• ETRI Journal
• /
• v.27 no.4
• /
• pp.355-366
• /
• 2005

Automatic discovery of physical topology plays a crucial role in enhancing the manageability of modern metro Ethernet networks. Despite the importance of the problem, earlier research and commercial network management tools have typically concentrated on either discovering logical topology, or proprietary solutions targeting specific product families. Recent works have demonstrated that network topology can be determined using the standard simple network management protocol (SNMP) management information base (MIB), but these algorithms depend on address forwarding table (AFT) entries and can find only spanning tree paths in an Ethernet mesh network. A previous work by Breibart et al. requires that AFT entries be complete; however, that can be a risky assumption in a realistic Ethernet mesh network. In this paper, we have proposed a new physical topology discovery algorithm which works without complete knowledge of AFT entries. Our algorithm can discover a complete physical topology including inactive interfaces eliminated by the spanning tree protocol in metro Ethernet networks. The effectiveness of the algorithm is demonstrated by implementation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.10C
• /
• pp.902-911
• /
• 2002

A wireless ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized adminstration or standard support services. Wireless ad-hoc networks may be quite useful in that they can be instantly deployable and resilient to change. In this environment, for many crucial distributed applications, it is necessary to design robust virtual infrastructures that are fault-tolerant, self-stabilized, and resource-efficient. For this task this paper proposes a scheme of maintaining robust spanning trees which are little affected by topological changes. By maintaining such a spanning tree and adapting it to the environments with frequent topological changes, one can improve the reliability and efficiency of many applications that use the spanning tree.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1324-1342
• /
• 2020

Various modified algorithms of rapidly-exploring random tree (RRT) have been previously proposed. However, compared to the RRT algorithm for collision avoidance with global and static obstacles, it is not easy to find a collision avoidance and local path re-planning algorithm for dynamic obstacles based on the RRT algorithm. In this study, we propose boundary-RRT*, a novel-algorithm that can be applied to aerial vehicles for collision avoidance and path re-planning in a three-dimensional environment. The algorithm not only bounds the configuration space, but it also includes an implicit bias for the bounded configuration space. Therefore, it can create a path with a natural curvature without defining a bias function. Furthermore, the exploring space is reduced to a half-torus by combining it with simple right-of-way rules. When defining the distance as a cost, the proposed algorithm through numerical analysis shows that the standard deviation (σ) approaches 0 as the number of samples per unit time increases and the length of epsilon ε (maximum length of an edge in the tree) decreases. This means that a stable waypoint list can be generated using the proposed algorithm. Therefore, by increasing real-time performance through simple calculation and the boundary of the configuration space, the algorithm proved to be suitable for collision avoidance of aerial vehicles and replanning of local paths.

• Journal of People, Plants, and Environment
• /
• v.24 no.1
• /
• pp.85-94
• /
• 2021

Background and objective: This study examined, compared, and analyzed the tree vitality of the trees growing on the artificial ground of Seoullo 7017 that transformed the overpass that was to be demolished into a "sky garden" using portable tree pots. Methods: Based on the summer season when the metabolic activity of plants is most active, this study measured the cambial electrical resistance in four directions(east, west, south and north), using the Shigometer (model OZ-93, Osmose) and compared the location and analysis of pots according to their means and standard errors. Results: Meanwhile, according to the analysis, vitality was relatively superior in pots with a big diameter, trees planted individually than in groups, trees of the ramp section rather than the bridge section, and in the southwest direction of the cambium. Conclusion: This study revealed the improper condition of the planting plan and implementation on the site, where various species of trees are displayed in a poor environment. Despite the significant assessment of the vitality of various trees introduced within Seoullo 7017 for the first time, this study is limited in that the data used were measured only once in summer. In this regard, it raised the need for continuous interest in and monitoring of a special plant environment and development of proper maintenance and management techniques, along with follow-up research on seasonal and temperature conditions, soil moisture and root development conditions to supplement this research.

• Journal of Navigation and Port Research
• /
• v.36 no.4
• /
• pp.285-290
• /
• 2012

e-Navigation strategy IMO promotes is defined as it is necessary for network and information standard to provide various maritime safety informations to in land and on board users, and it is expected to provide a large amount and diverse kinds of maritime spatial information services to them. However, as there are some limits to transmit that by current mobile maritime communication technologies, it is required to simplify and optimize the information. In this study, tree node method is applied to ENC using Douglas-Peucker algorithm and we arranged the effect of simplified spatial information through CALS method which compensates the defect of basic tree node method.

• Asian-Australasian Journal of Animal Sciences
• /
• v.18 no.12
• /
• pp.1696-1700
• /
• 2005

Five China native cattle breeds have been characterized by using 10 microsatellite DNA markers. The studied populations can be divided into five groups: Luxi cattle, Nanyang cattle, Jinnan cattle, Qinchuan cattle and Yanbian cattle. Allele frequencies were calculated and used for the characterization of the breeds and the study of their genetic relationships. Heterozygosity, polymorphism information content, the effective number of alleles was calculated. Nei' standard genetic distance (1978) was calculated and used for a neighbor-joining tree construction. NJ tree showed that Luxi cattle, Nanyang cattle, Jinnan cattle and Qinchuan cattle are closely related, whereas Yanbian cattle are clearly distinct from other four populations. The genetic relationship of five breeds corresponds to their history and geographic origins. This work analyzes the recent origin of these populations and contributes to the knowledge and genetic characterization of China native breeds.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.4
• /
• pp.191-198
• /
• 2003

The generalized knapsack problem or gknap is the combinatorial optimization problem of optimizing a nonnegative linear function over the integral hull of the intersection of a polynomially separable 0-1 polytope and a knapsack constraint. The knapsack, the restricted shortest path, and the constrained spanning tree problem are a partial list of gknap. More interesting1y, all the problem that are known to have a fully polynomial approximation scheme, or FPTAS are gknap. We establish some necessary and sufficient conditions for a gknap to admit an FPTAS. To do so, we recapture the standard scaling and approximate binary search techniques in the framework of gknap. This also enables us to find a weaker sufficient condition than the strong NP-hardness that a gknap does not have an FPTAS. Finally, we apply the conditions to explore the fully polynomial approximability of the constrained spanning problem whose fully polynomial approximability is still open.

• Asian-Australasian Journal of Animal Sciences
• /
• v.15 no.4
• /
• pp.591-595
• /
• 2002

Three hundred thirty five progeny testing steers of Korean beef cattle were evaluated ultrasonically for back fat thickness (BFT), longissimus muscle area (LMA) and intramuscular fat (IF) before slaughter. Class measurements associated with the Korean yield grade and quality grade were also obtained. Residual standard deviation between ultrasonic estimates and carcass measurements of BFT, LMA were 1.49 mm and $0.96cm^2$. The linear correlation coefficients (p<0.01) between ultrasonic estimates and carcass measurements of BFT, LMA and IF were 0.75, 0.57 and 0.67, respectively. Results for improving predictions of yield grade by four methods-the Korean yield grade index equation, fat depth alone, regression and decision tree methods were 75.4%, 79.6%, 64.3% and 81.4%, respectively. We conclude that the decision tree method can easily predict yield grade and is also useful for increasing prediction accuracy rate.

• IE interfaces
• /
• v.11 no.1
• /
• pp.67-74
• /
• 1998

This study is to develop a vehicle scheduling system for the efficient delivery of goods to places of business. For gathering data and testing the system developed, we have chosen a company which is located in Taegu city and has more than 700 delivery points over Taegu city and Kyungbuk province. We consider multiple vehicle types, travel time restrictions on vehicles, vehicle acceptance restrictions at delivery points, and other operational restrictions. We divide the whole delivery points into 44 regions and generate a region-based shortest path tree. Based on the shortest path tree, we perform vehicle assignment sequentially for each vehicle used. Then vehicle routings are determined. We have implemented the whole procedure on computer system. The system developed is flexible enough to be applicable to other companies by just changing the standard data.

• Journal of the Korean Statistical Society
• /
• v.28 no.1
• /
• pp.73-92
• /
• 1999

In Bayesian model selection or testing problems, one cannot utilize standard or default noninformative priors, since these priors are typically improper and are defined only up to arbitrary constants. The resulting Bayes factors are not well defined. A recently proposed model selection criterion, the intrinsic Bayes factor overcomes such problems by using a part of the sample as a training sample to get a proper posterior and then use the posterior as the prior for the remaining observations to compute the Bayes factor. Surprisingly, such Bayes factor can also be computed directly from the full sample by some proper priors, namely intrinsic priors. The present paper explains how to derive intrinsic priors for simple tree ordered exponential means. Some numerical results are also provided to support theoretical results and compare with classical methods.