• Wind and Structures
• /
• 제26권1호
• /
• pp.45-56
• /
• 2018

Wind damage of urban trees arises to be a serious issue especially in the typhoon-prone areas. As a family of tree species widely-planted in Southeast China, the structural behaviors of Plane tree is investigated. In order to accommodate the complexities of tree morphology, a fractal theory based finite element modeling method is proposed. On-site measurement of Plane trees is performed for physical definition of structural parameters. It is revealed that modal frequencies of Plane trees distribute in a manner of grouped dense-frequencies; bending is the main mode of structural failure. In conjunction with the probability density evolution method, the fragility assessment of urban trees subjected to wind excitations is then proceeded. Numerical results indicate that small-size segments such as secondary branches feature a relatively higher failure risk in a low wind level, and a relatively lower failure risk in a high wind level owing to windward shrinks. Besides, the trunk of Plane tree is the segment most likely to be damaged than other segments in case of high winds. The failure position tends to occur at the connection between trunk and primary branches, where the logical protections and reinforcement measures can be implemented for mitigating the wind damage.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 1999년도 춘계학술대회 논문집
• /
• pp.234-238
• /
• 1999

The correlation between shape of electrical trees and partial discharge(PD) pulses in low density polyethylene(LDPE) were discussed. We observed growth feature of electrical tree by using optical microscope. On the basis of experimental results of measurements of trees occurring in the needle-plane arrangement with needle shape void and without needle shape void , statistical quantities are derived, which are relevant to PD pulse amplitude and phase. The PD quantities detected by partial discharge detector. we were analyzed q-n distribution pattern and $\psi$ -q-n distribution pattern. In this experiment, electrical trees in the needle-plane arrangement with needle shape void propagated branch type tree and in the needle-plane arrangement without needle shape void propagated bush type tree

• 한국게임학회 논문지
• /
• 제13권4호
• /
• pp.25-34
• /
• 2013

3D 게임에서 충돌 탐지를 효과적으로 하기 위해 구성하는 공간 분할 트리는 분할 평면을 결정하는데 트리 밸런스와 분할 평면과 겹치는 폴리곤의 개수 등을 고려해야 한다. 본 논문에서는 3D 게임 공간 분할 트리에서 트리 빌드 조건에 대한 가중치를 제어하는 휴리스틱 알고리즘을 제안하였다. 가중치의 변화에 따라서 트리 빌드 시간, 분할 평면과 겹치는 폴리곤을 쪼갤 때 시각적 불일치를 유발할 수 있는 T-junction 의 제거 시간, 트리 밸런스에 따른 렌더링 속도(frame per second) 등을 3D 게임 시뮬레이션을 통하여 분석하였다.

• 한국전산응용수학회:학술대회논문집
• /
• 한국전산응용수학회 2003년도 KSCAM 학술발표회 프로그램 및 초록집
• /
• pp.16.1-16
• /
• 2003

A subset S of vertices of a graph G is independent if no two vertices of S are adjacent by an edge in G. Also we say that S is maximal independent if it is contained In no larger independent set in G. A planted plane tree is a tree that is embedded in the plane and rooted at an end-vertex. A (k＋1) -valent tree is a planted plane tree in which each vertex has degree one or (k＋1). We classify maximal independent sets of (k＋1) -valent trees into two groups, namely, type A and type B maximal independent sets and consider specific independent sets of these trees. We study relations among these three types of independent sets. Using the relations, we count the number of all maximal independent sets of (k＋1) -valent trees with n vertices of degree (k＋1).

• 전기전자학회논문지
• /
• 제24권2호
• /
• pp.372-377
• /
• 2020

본 논문은 인셋 구조의 삼각 패치 안테나를 기본 구조로 하며, 배열 구조를 트윈 트리 형태로 하여 안테나 주엽 이득을 개선시키고 부엽 이득을 줄이는 연구에 대한 것이다. 삼각 인셋 패치의 2-4-6개의 배열로 이루어진 동일한 트리 2개를 나란히 배치하여 트윈 트리 구조를 구현했다. 파라미터 분석을 통해 나란히 배치된 트리 구조 간의 간격이 임피던스 매칭에 가장 효과적인 것을 확인했다. 제작된 안테나는 24.15 GHz에서 16.74 dBi 이득을 갖고, E-plane에서 주엽의 빔폭은 22°, H-plane에서는 6°이다. 안테나 크기는 125 mm × 50 mm이며, 유전상수가 3.2인 Taconic TLC 기판을 사용했다. 트윈 트리 구조의 주엽 이득은 개선되었지만 2개 트리 배열 구조의 상호 간섭으로 인한 빔 패턴에서의 지향성 부분은 개선할 여지가 있다.

• Journal of applied mathematics & informatics
• /
• 제28권3_4호
• /
• pp.893-908
• /
• 2010

In this paper we prove the existence of spanning 3-trees in a 3-connected infinite locally finite VAP-free plane graph. Together with the results of Barnette and the author, this yields that every finite or infinite 3-connected locally finite VAP-free plane graph contains a spanning 3-tree.

• Journal of information and communication convergence engineering
• /
• 제20권3호
• /
• pp.160-165
• /
• 2022

This paper proposes an efficient method of reconstructing interconnections when the terminals of each plane change in real-time situations where randomly divided planes are interconnected. To connect all terminals when the terminals of each plane are changed, we usually reconstruct the interconnections between all terminals. This ensures a minimum connection length, but it takes considerable time to reconstruct the interconnection for the entire terminal. This paper proposes a solution to obtain an optimal tree close to the minimum spanning tree (MST) in a short time. The construction of interconnections has been used in various design-related areas, from networks to architecture. One of these areas is an ad hoc network that only consists of mobile hosts and communicates with each other without a fixed wired network. Each host of an ad hoc network may appear or disappear frequently. Therefore, the heuristic proposed in this paper may expect various cost savings through faster interconnection reconstruction using the given information in situations where the connection target is changing.

• 한국정보과학회논문지:시스템및이론
• /
• 제31권1_2호
• /
• pp.78-85
• /
• 2004

이차원 평면에 주어진 n개의 점을 연결하는 신장트리(spanning tree) 중에서, 지름이 최소가 되는 트리는 특정 점에서의 분지수(degree)가 n-1까지 증가할 수 있다. 신장트리가 실제 네트워크 구조로 사용된다면 높은 분지수를 갖는 노드에선 작업 집중현상이 발생하여 전체 네트워크의 성능을 저하시킬 수 있다. 따라서 작은 분지수와 작은 지름을 갖는 트리를 구성하는 것은 중요하다. 본 논문에서는 (1) 트리의 분지수를 자유롭게 조정할 수 있고, (2) 트리의 지름이 최소 지름보다 상수 배 이상 크지 않고, (3) 임의의 점을 루트로 정하여 트리를 구하더라도 항상 단조(monotone)하며, (4) 트리의 에지들이 서로 교차하지 않는 신장트리 구성 알고리즘을 제안한다. 여기서 트리가 단조하다는 것은 루트부터 시작하여 임의의 노드까지 연결되는 경로 위에 있는 점은 루트로부터의 유클리디언 거리가 단순 증가하는 것을 의미한다. 이 단조성은 신장트리를 가시화 할 때의 중요한 미적 기준으로 사용될 수 있다.

• 대한수학회지
• /
• 제39권2호
• /
• pp.205-219
• /
• 2002

We deride formulas for the expected values $\mu$(n) of the independent domination numbers of a random planted plane tree and a random trivalent tree with n vertices, respectively, and we determine the asymptotic behavior of $\mu$(n) as n goes to infinity.

• 한국경영과학회지
• /
• 제25권3호
• /
• pp.17-33
• /
• 2000

We consider the Steiner tree packing problem. For a given undirected graph G =(V, E) with positive integer capacities and non-negative weights on its edges, and a list of node sets(nets), the problem is to find a connection of nets which satisfies the edge capacity limits and minimizes the total weights. We focus on the switchbox routing problem in knock-knee model and formulate this problem as an integer programming using Steiner tree variables. The model contains exponential number of variables, but the problem can be solved using a polynomial time column generation procedure. We test the algorithm on some standard test instances and compare the performances with the results using cutting plane approach. Computational results show that our algorithm is competitive to the cutting plane algorithm presented by Grotschel et al. and can be used to solve practically sized problems.