• 제목/요약/키워드: tree number

검색결과 1,754건 처리시간 0.026초

A Scalable Recovery Tree Construction Scheme Considering Spatial Locality of Packet Loss

  • Baek, Jin-Suk;Paris, Jehan-Francois
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제2권2호
    • /
    • pp.82-102
    • /
    • 2008
  • Packet losses tend to occur during short error bursts separated by long periods of relatively error-free transmission. There is also a significant spatial correlation in loss among the receiver nodes in a multicast session. To recover packet transmission errors at the transport layer, tree-based protocols construct a logical tree for error recovery before data transmission is started. The current tree construction scheme does not scale well because it overloads the sender node. We propose a scalable recovery tree construction scheme considering these properties. Unlike the existing tree construction schemes, our scheme distributes some tasks normally handled by the sender node to specific nodes acting as repair node distributors. It also allows receiver nodes to adaptively re-select their repair node when they experience unacceptable error recovery delay. Simulation results show that our scheme constructs the logical tree with reduced message and time overhead. Our analysis also indicates that it provides fast error recovery, since it can reduce the number of additional retransmissions from its upstream repair nodes or sender node.

정규 허프만 트리를 이용한 허프만 코드의 효율적인 디코딩 (Efficient Huffman Decoding using Canonical Huffman Tree)

  • 박상호
    • 한국컴퓨터정보학회논문지
    • /
    • 제12권4호
    • /
    • pp.111-117
    • /
    • 2007
  • 본 논문에서는 정규 허프만 트리의 성질을 이용하여 허프만 코드를 효율적으로 디코딩 하는 방법을 제안하고 그 특성을 살펴보았다. 허프만 코드를 정규 허프만 트리로 변환한 후 각 레벨의 단말 노드 값들에 대한 규칙을 이용하여 최소한의 정보로 허프만 트리를 표현하였다. 제안한 방법은 기존의 방법과 동일한 수행 시간을 유지하며 트리정보를 위한 메모리를 줄일 수 있었다. 트리정보를 저장하기 위한 메모리의 크기는 2h + 2klogn로서 기존의 방법들보다 적었으며 심벌로 변환하기 위한 검색의 수는 비슷하였다.

  • PDF

가역가변길이 부호를 위한 테이블 압축방법 (A Table Compression Method for Reversible Variable Length Code)

  • 임선웅;배황식;정정화
    • 대한전자공학회논문지SP
    • /
    • 제38권3호
    • /
    • pp.316-324
    • /
    • 2001
  • 본 논문에서는 가역가변길이 부호를 테이블 메모리에 효율적으로 저장하는 방법을 제안한다. 여러개의 부호들을 적은 개수의 값들로 테이블을 구성하는 새로운 알고리듬으로, 가역가변길이 부호의 부호내의 비트 천이개수와 부호 구성 트리에서의 레벨을 이용하는 TNWT(Transition Number and Weight of Tree)방법을 제안한다. 압축에 앞서 가역가변길이 부호들의 가중치와 천이개수를 구하고, 신장된 값들이 서로 구분이 안되는 경우를 방지하기 위해 테이블의 값들을 재배열한다. 재배열이 끝난 배열의 값들을 세 개씩 묶어 압축된 테이블을 얻는다. 압축된 테이블은 부호의 천이개수와 가중치를 이용하여 복호해 낼 수 있다. 이러한 방법을 통하여 기존의 방법보다 약 20% 적은 크기로 테이블 메모리를 구성하고, 압축된 테이블로 복호가 가능함을 확인하였다.

  • PDF

Morphological Variations in Tetrapleura tetraptera Taub. (Fabaceae) Fruits and Seed Traits from Lowland Rainforest Zones of Nigeria: A Keystone Non Timber Forest Tree Species in the Tropics

  • Aishat Adeola Olaniyi;Samuel Olalekan Olajuyigbe;Musbau Bayo Olaniyi
    • Journal of Forest and Environmental Science
    • /
    • 제40권2호
    • /
    • pp.111-117
    • /
    • 2024
  • An evaluation was carried out on variability in morphology of fruits and seeds (number and weight) of Tetrapleura tetraptera (Schumach. and Thonn.) Taub. from different populations across its distribution range in Nigeria. Bulk fruit samples were collected and examined for variations in morphological characters. Differences in morphological character of fruits and seeds among the populations were determined using analysis of variance at 5% level of probability. The relationships among morphological characters were determined using Pearson correlation coefficient (r). Significant variations (p<0.05) existed among T. tetraptera populations for all the evaluated characters: fruit length, fruit width, number of seeds per fruit and seed weight. A positive significant strong correlation (r=0.96) was found between seed weight and number of seeds per fruit, while no correlation existed between fruit length, width and number of seeds. Seed weight was positively correlated with minimum altitude (r=0.97) and maximum altitude (r=0.99) of seed populations. Number of seeds was also significantly correlated with maximum altitude (r=0.965). There was no significant correlation between geo-climatic variables and fruit dimensions (length and width). Observed variations in morphological traits within and across populations of T. tetraptera may be used as proxy to estimate genetic diversity and selection of superior trees for improved productivity.

금정산성 주변 식생의 생태적 특성과 복원방안 (Restoration Plan and Ecological Characteristics of Vegetation in the Area Adjacent to GeumJeong Mountain Fortress)

  • 김석규
    • 환경영향평가
    • /
    • 제19권3호
    • /
    • pp.231-245
    • /
    • 2010
  • The the purpose of this study was to analyze of the vegetation structure and phytosociological changes in the area adjacent to GeumJeong Mountain Fortress for fifteen years. The result of this study was as follows; Of the 8 quadrates, site of the North Gate 2 was having a highest in the number of extinct trees, 15 kinds. This is probably due to trampling effect caused by climbers' steps. Site of the West Gate 1 and South gate 1 each had 8 kinds of extinct trees, respectively. The number of newly appeared trees was highest at site of the North Gate 1, (8 kinds) followed by the sites of South gate 1 and South gate 2, respectively (5 kinds). The highest decrease in number of tree species was observed in North Gate 1, therefore, there is a strong relationship between vegetation diversity and the number of users of the available spaces. In order to revitalize the unstable vegetation structure of the Area Adjacent to GeumJeong Mountain Fortress, Robinia pseudo-acacia has to be well maintained in the shrub tree layer, and vines, such as Smilax china, Humulus japonicus, and Pueraria thungergiana, should be removed. To recover natural vegetation, dead leaf layer should be protected, and more shrub trees need to be planted. In the understory and shrub tree layer, multi layer tree planting is highly recommended to recover natural vegetation and increase tree diversity. In order to improve bad soil condition caused by trampling effect of recreational users, special treatments to the soil structure are required, such as mulching and raking soil. Also, depending on its soil damage from users trampling, the areas in the park should be divided into usable areas and user limited areas by the sabbatical year system. To improve the soil acidity due to acidic rain, soil buffering ability should be improved by activating microorganisms in the soil by using lime and organic material.

동적 XML 데이터 관리를 위한 트리 분해 기반의 소수 레이블링 기법 (A Prime Number Labeling Based on Tree Decomposition for Dynamic XML Data Management)

  • 변창우
    • 한국컴퓨터정보학회논문지
    • /
    • 제16권4호
    • /
    • pp.169-177
    • /
    • 2011
  • 갱신 연산의 허용으로 동적 XML 데이터의 처리 효율성의 요구가 증대하면서 새로운 동적 XML 레이블링 기법들이 연구되어 왔다. 동적 XML 레이블링 기법의 핵심적인 해결 사항으로는 조상-자손-형제 관계 결정, 레이블 저장공간의 절약, 빠른 응답시간, 갱신에 의한 레이블 재작성의 최소화이다. 대표적인 동적 레이블링 기법으로 소수 기반 레이블링 기법이 있다. 소수 기반 레이블링 기법은 소수의 특성을 이용하여 조상-자손 관계를 쉽게 결정한다. 또한 새로운 엘리먼트를 삽입할 때도 기존 노드의 레이블을 재작성하는 비용이 발생되지 않는 장점을 갖고 있다. 하지만 소수를 많이 사용하면 레이블의 값이 상당히 커지게 되는 레이블 오버플로우 문제가 발생된다. 본 논문에서는 레이블 오버플로우 문제를 효과적으로 줄이는 새로운 방법을 소개한다. 제안하는 방법의 핵심 개념은 트리 분해이다. 레이블 오버플로우가 발생하면 트리를 하부 트리들로 분해하고 레이블은 각 하부 트리에 한해서 부여하는 것이다. 실험을 통해 트리 분해 기반의 소수 기반 레이블링 기법의 효과를 보인다.

Fault Tree Analysis(FTA)에 의한 Toluene저장 Tank의 폭발해석 (The Evaluation of Explosion For Toluene Storage Tank by Computer-Aided Fault Tree Analysis)

  • 정재희;이영섭
    • 한국안전학회지
    • /
    • 제3권2호
    • /
    • pp.5-16
    • /
    • 1988
  • This study is conducted to evaluate the explosion of tolune storage tank in the petrochemical plant by Fault Tree Analysis. The conclusions are as follows; 1) Fault Tree diagram and the required computer program for evaluation of explosion accident is developed. 2) The probability of the top event, explosion accident, is $1.5\;{\times}\;10^{-8}$ per year, so there is almost no possibility of explosion during the life cycle of tank. However, the probability of Gate 6 and Gate 7 is 8.8 per month, therefore, attention should be paid to them for accident prevention. 3) The number of minimal cut sets is 67 sets which are not calculated the probability of each set, because of the lack of computer capacity. All the minimal cut sets should be examined case by case. However, it is necessary to be paid attention to COM1, 126, 131, and COM4 in minimal cut sets, because the number of appearance is so high. 4) The number path sets is 70 sets which are not calculated the probability of each set, because of the lack of computer capacity. It is very useful to prepare safety checklist by using this minimal path sets. Also, the events which appear many times, 123, COM5, 139, 127 and 128, are very high in reliability.

  • PDF

A customer credit Prediction Researched to Improve Credit Stability based on Artificial Intelligence

  • MUN, Ji-Hui;JUNG, Sang Woo
    • 한국인공지능학회지
    • /
    • 제9권1호
    • /
    • pp.21-27
    • /
    • 2021
  • In this Paper, Since the 1990s, Korea's credit card industry has steadily developed. As a result, various problems have arisen, such as careless customer information management and loans to low-credit customers. This, in turn, had a high delinquency rate across the card industry and a negative impact on the economy. Therefore, in this paper, based on Azure, we analyze and predict the delinquency and delinquency periods of credit loans according to gender, own car, property, number of children, education level, marital status, and employment status through linear regression analysis and enhanced decision tree algorithm. These predictions can consequently reduce the likelihood of reckless credit lending and issuance of credit cards, reducing the number of bad creditors and reducing the risk of banks. In addition, after classifying and dividing the customer base based on the predicted result, it can be used as a basis for reducing the risk of credit loans by developing a credit product suitable for each customer. The predicted result through Azure showed that when predicting with Linear Regression and Boosted Decision Tree algorithm, the Boosted Decision Tree algorithm made more accurate prediction. In addition, we intend to increase the accuracy of the analysis by assigning a number to each data in the future and predicting again.

일반적인 GPU 트리 탐색과의 비교실험을 통한 GPU 기반 병렬 Shifted Sort 알고리즘 분석 (Analysis of GPU-based Parallel Shifted Sort Algorithm by comparing with General GPU-based Tree Traversal)

  • 김희수;박태정
    • 디지털콘텐츠학회 논문지
    • /
    • 제18권6호
    • /
    • pp.1151-1156
    • /
    • 2017
  • 일반적으로 GPU 기반 트리 탐색을 수행할 경우 병렬 처리 속도가 생각보다 크게 향상되지 않는 경우가 대부분이다. 본 논문에서는 이러한 원인을 분석하고 그 분석 결과로 GPU 병렬 처리 하드웨어 아키텍처 내 최소 물리적 스레드 실행 단위인 warp 내에서 분기문(if문)으로 인한 warp divergence가 일어나기 때문임을 제시한다. 또한 이러한 warp divergence를 최소화할 수 있는 병렬 shifted sort 알고리즘과의 비교를 통해 shifted sort 알고리즘이 일반적인 GPU 내 트리 탐색에 비해 우수한 성능을 보이는 구조임을 제시하였다. 분석 결과 GPU 기반 kd-tree 탐색에 비해 warp divergence가 발생하지 않은 shifted sort 탐색은 3차원 공간에서 데이터나 쿼리의 수가 $2^{23}$개 일 때 16배 이상의 빠른 처리 속도를 보였으며 이 성능 차이는 데이터나 쿼리의 개수가 증가함에 따라 더 커지는 경향을 보였다.

Variation in Seed and Cone Characteristics of Loblolly Pine (Pinus taeda L.) Families in Southern Part of Korea

  • Lee, Hyunseok;Lim, Hyemin;Lee, Wiyoung;Jang, Kyunghwan;Kang, Junwon
    • Journal of Forest and Environmental Science
    • /
    • 제34권1호
    • /
    • pp.82-86
    • /
    • 2018
  • Loblolly pine (Pinus taeda L.) is widely distributed in the southern part of the United States and it has been used as a major economic species in the region due to its excellent growth and stem straightness. The tree also grows only in the southern part of Korea because it is susceptible to cold. Recently climate changes have had widespread impacts on forest trees. Thus, the use of good quality seeds is prerequisite for assessing assisted migration adaptation trial. In this study, we conducted to investigate its cone and seed characteristics of each family, which is expected to improve seeds productivity for planting valuable timber trees. A total of 14 families were selected from the experimental forest in Boseong, Jeonnam province in 1981. The seed production capacity was estimated to range from 87.2 to 129.4 among families and the average was 111.3. The number of aborted ovules was investigated in the range of 11.4 to 29.5 for the first test and 7.4 to 22.2 for the second test. The average number of empty and filled seeds was 1.4 and 79.2 per cone, respectively. Based on the results, we can conclude that there is a strong correlation between the number of fertile scale and the seed production ability.