• ETRI Journal
• /
• 제23권3호
• /
• pp.111-120
• /
• 2001

For scalable multicast transport, one of the promising approaches is to employ a control tree known as acknowledgement (ACK) tree which can be used to convey information on reliability and session status from receivers to a root sender. The existing tree configuration has focused on a 'bottom-up' scheme in which ACK trees grow from leaf receivers toward a root sender. This paper proposes an alternative 'top-down' configuration where an ACK tree begins at the root sender and gradually expands by including non-tree nodes into the tree in a stepwise manner. The proposed scheme is simple and practical to implement along with multicast transport protocols. It is also employed as a tree configuration in the Enhanced Communications Transport Protocol, which has been standardized in the ITU-T and ISO/IEC JTC1. From experimental simulations, we see that the top-down scheme provides advantages over the existing bottom-up one in terms of the number of control messages required for tree configuration and the number of tree levels.

• 대한수학회지
• /
• 제41권5호
• /
• pp.921-931
• /
• 2004

We derive a formula for the expected value $\mu$(n) of the independent domination number of a random directed rooted tree with n labeled vertices and determine the asymptotic behavior of $\mu$(n) as n goes to infinity.

• 한국환경생태학회지
• /
• 제15권4호
• /
• pp.394-400
• /
• 2002

무작위표본추출법에 의한 산림군집구조 조사시 교목층과 관목층의 적정 조사구수를 파악하기 위하여 혼효율이 비교적 높은 구룡산 상금정계곡 활엽수혼효림군집의 교목층과 관목층을 대상으로 각각 10m$\times$10m, 5m$\times$5m 크기의 조사구를 15개씩 설치한 후 종수-면적 곡선, performance curve 등을 적용하였다. 종수-면적 곡선에의한 교목층의 적정 조사구수는 일반적인 수준에서 5개 이상이었으며, 보다 정확성을 요구할 경우 10개 이상이었다. 교목층의 상대중요치에 의한 performance curve를 작성한 결과 조사구수 4개 이상에서 우점종과 준우점종의 구분이 뚜렷해지며, 조사구수 8개 이상에서는 준우점종의 순위가 일정한 경향이었다 교목충의 종다양도는 조사구수 7개 이상에서 비교적 일정한 경향을 보였으며 조사군집을 대표한다고 할 수 있는 전체 조사구수 15개의 종다양도와 0.05 이내의 차이를 보였다. 교목층 전체 조사구수와의 유사도지수는 조사구수 5개 이상에서 80% 이상, 9개 이상에서 90% 이상이었다 관목층의 경우, 종수-면적 곡선에 의한 적정 조사구수는 일반적인 수준에서 5개 이상이었으며, 보다 정확성을 요구할 경우 12개 이상이었다. 관목충의 상대중요치에 의한 performance curve를 작성한 결과 조사구수 4개 이상에서 우점종과 준우점종의 구분이 뚜렷하였으며, 조사구수 13개 이상에서는 준우점종의 순위가 일정한 경향으로 유지되었다. 관목층 종다양도는 조사구수 6개 이상에서 비교적 일정한 경향을 보였으며, 조사군집을 대표한다고 할 수 있는 전체 조사구수 15개의 종다양도와 0.05이내의 차이를 보였다. 관목층 전체 조사구와의 유사도지수는 조사구수 5개 이상에서 80%, 9개 이상에서 90% 이상이었다. 이상을 종합하면, 우점종과 준우점종이 구분되는 일반적인 수준의 적정 조사구수는 교목층과 관목층 모두 대체로 5개, 준우점종 내에서의 순위까지 구분되는 보다 정화겅을 요구하는 수준의 적정 조사구수는 교목층 10개, 관목층 13개 정도이었다.

• Journal of Communications and Networks
• /
• 제16권6호
• /
• pp.613-619
• /
• 2014

Multicast routing algorithms designed for wireline networks are not suitable for wireless environments since they cannot efficiently exploit the inherent characteristics of wireless networks such as the broadcast advantage. There are many routing protocols trying to use these advantages to decrease the number of required transmissions or increase the reception probability of data (e.g., opportunistic routing).Reducing the number of transmissions in a multicast tree directly decreases the bandwidth consumption and interference and increases the overall throughput of the network. In this paper, we introduce a distributed multicast routing protocol for wireless mesh networks called NCast which take into account the data delivery delay and path length when constructing the tree. Furthermore, it effectively uses wireless broadcast advantage to decrease the number of forwarding nodes dynamically when a new receiver joins the tree.Our simulation results show that NCast improves network throughput, data delivery ratio and data delivery delay in comparison with on demand multicast routing protocol. It is also comparable with multichannel multicast even though it does not use channeling technique which eliminates the interference inherently.

• 한국산림과학회지
• /
• 제62권1호
• /
• pp.19-23
• /
• 1983

잣나무 성숙목(成熟木)을 대상(對象)으로 수형(樹形)이 결실량(結實量)에 미치는 영향(影響)에 관(關)하여 조사분석(調査分析) 하였든 바, 잣나무의 착과수(着果數)는 수형(樹形)을 구성(構成)하는 여러 요인(要因)과 밀접(密接)한 상관관계(相關關係)를 갖고 있었다. 즉(即), 착과수(着果數)는 흉고직경(胸高直徑) 수관체적(樹冠體積)이 클수록, 그리고 주간(主幹)의 분간수(分幹數)가 많을 수록 증가(增加)함을 알 수 있었다. 그러나 수고(樹高) 수관장(樹冠長) 및 수관(樹冠)의 형상비(形狀比)는 착과수(着果數)와 상관(相關)이 없음을 보여 주었다.

• 한국초등과학교육학회지:초등과학교육
• /
• 제26권3호
• /
• pp.329-340
• /
• 2007

This study is to find out how well elementary school gardens work as places of observation learning. We compared the tree species planted in elementary school gardens with those which appeared in the science textbooks of the 7th Korean National Curriculum. The number of tree species are 60 throughout all the grades, specifically; 43 in the third grade, 22 in the fifth grade, 16 in the first grade, 15 in the second grade, 8 in the sixth grade, and 5 in the fourth grade, respectively. Their frequency of appearance (hereafter referred to as 'appearance frequency') throughout all the grades is 175, and the maximum frequency is 62 in the third grade. Of particular note is the fact that the appearance frequency in one grade was very high, meaning that a repeat study will not be conducted. The total number of tree species counted in the study was 13,028 and consisted of 167 species in 52 families. Only 23% of the total planted tree species, that is, 38 tree species appeared in the textbooks, so the ratio of the practical usage of school gardens was revealed to be low. In the school gardens, there are only an average of about 16 tree species per school. The fewest number of species in one school was 9 and the most was 22. The native species were 74 and the non-native species were 93. This means that almost all the planted species do not relate to observation learning in the textbooks. The 22 tree species among 60 species in the textbooks were not planted in the gardens. In conclusion, the degree of utilization of almost all the elementary school gardens examined during this investigation was very low.

• 조명전기설비학회논문지
• /
• 제22권9호
• /
• pp.82-87
• /
• 2008

국내 택배시장은 과거 몇 개의 업체에서 독점해왔으나 현재는 대기업들과 수많은 중소기업들이 참여하고 있어 경쟁이 심화되고 있다. 우편물의 신속한 배송과 운송비용의 최소화는 매우 중요하며 이를 위하여 운송거리의 최단 거리화가 우선 필요하다. 본 논문은 전국의 주요 도시에 배치된 우편집중국을 기하적으로 가장 짧게 연결하는 교환 센터의 최적 위치를 찾는 방법을 제시한다. 송전계통의 routing, 배전선로망의 최적화 등에 이용되고 있는 Steiner Tree이론을 최단거리 우편물 운송망 구축에 적용하였다. Steiner Tree이론으로부터 선정된 위치에 교환센터를 설치할 경우, 운송비를 절감하여 경영수지를 개선할 뿐 아니라 신속한 배달을 최우선으로 하는 택배 시장에서 우위를 점할 수 있을 것으로 기대된다. Steiner Tree 이론은 차기 초고압 선로를 최단거리로 연결하는 전력소의 위치선정 등에도 활용될 수 있을 것으로 사료된다.

• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2003년도 Proceeding
• /
• pp.223-230
• /
• 2003

Feature-based similarity retrieval has become an important research issue in multimedia database systems. The features of multimedia data are useful for discriminating between multimedia objects (e 'g', documents, images, video, music score, etc.). For example, images are represented by their color histograms, texture vectors, and shape descriptors, and are usually high-dimensional data. The performance of conventional multidimensional data structures(e'g', R- Tree family, K-D-B tree, grid file, TV-tree) tends to deteriorate as the number of dimensions of feature vectors increases. The R＊-tree is the most successful variant of the R-tree. In this paper, we propose a SOM-based R＊-tree as a new indexing method for high-dimensional feature vectors.The SOM-based R＊-tree combines SOM and R＊-tree to achieve search performance more scalable to high dimensionalities. Self-Organizing Maps (SOMs) provide mapping from high-dimensional feature vectors onto a two dimensional space. The mapping preserves the topology of the feature vectors. The map is called a topological of the feature map, and preserves the mutual relationship (similarity) in the feature spaces of input data, clustering mutually similar feature vectors in neighboring nodes. Each node of the topological feature map holds a codebook vector. A best-matching-image-list. (BMIL) holds similar images that are closest to each codebook vector. In a topological feature map, there are empty nodes in which no image is classified. When we build an R＊-tree, we use codebook vectors of topological feature map which eliminates the empty nodes that cause unnecessary disk access and degrade retrieval performance. We experimentally compare the retrieval time cost of a SOM-based R＊-tree with that of an SOM and an R＊-tree using color feature vectors extracted from 40, 000 images. The result show that the SOM-based R＊-tree outperforms both the SOM and R＊-tree due to the reduction of the number of nodes required to build R＊-tree and retrieval time cost.

• 대한수학회보
• /
• 제44권2호
• /
• pp.259-263
• /
• 2007

Which spheres are shellable?[2]. We present one of them which is the k-tree with n-labeled vertices. We found that the number of ways to shell the k-dimensional trees on n-labeled vertices is $$\frac{n!}{(k+1)!}(nk-k^2-k+1)!k$$.

• 대한수학회보
• /
• 제56권1호
• /
• pp.31-44
• /
• 2019

A graph theoretical model called Roman domination in graphs originates from the historical background that any undefended place (with no legions) of the Roman Empire must be protected by a stronger neighbor place (having two legions). It is applicable to military and commercial decision-making problems. A Roman dominating function for a graph G = (V, E) is a function $f:V{\rightarrow}\{0,1,2\}$ such that every vertex v with f(v)=0 has at least a neighbor w in G for which f(w)=2. The Roman domination number of a graph is the minimum weight ${\sum}_{v{\in}V}\;f(v)$ of a Roman dominating function. In order to deal a problem of a Roman domination-type defensive strategy under multiple simultaneous attacks, ${\acute{A}}lvarez$-Ruiz et al. [1] initiated the study of a new parameter related to Roman dominating function, which is called strong Roman domination. ${\acute{A}}lvarez$-Ruiz et al. posed the following problem: Characterize the graphs G with equal strong Roman domination number and Roman domination number. In this paper, we construct a family of trees. We prove that for a tree, its strong Roman dominance number and Roman dominance number are equal if and only if the tree belongs to this family of trees.