• Journal of applied mathematics & informatics
• /
• v.33 no.5_6
• /
• pp.517-530
• /
• 2015

In this paper, we establish a class of strong limit theorems, represented by inequalities, for the arbitrary random field with respect to the product binomial distributions indexed by the infinite tree on the generalized random selection system by constructing the consistent distri-bution and a nonnegative martingale with pure analytical methods. As corollaries, some limit properties for the Markov chain field with respect to the binomial distributions indexed by the infinite tree on the generalized random selection system are studied.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.283-293
• /
• 2010

In this paper, inverse constrained minimum spanning tree problem under Hamming distance. Such an inverse problem is to modify the weights with bound constrains so that a given feasible solution becomes an optimal solution, and the deviation of the weights, measured by the weighted Hamming distance, is minimum. We present a strongly polynomial time algorithm to solve the inverse constrained minimum spanning tree problem under Hamming distance.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.49 no.5
• /
• pp.59-70
• /
• 2021

This study was to investigate the measurement point of root collar diameter of landscape trees in Korea. It may contribute to avoiding disputes caused by the difference in measurement criteria of root collar diameter of landscape trees between tree growers and constructors. The difference between landscape trees' root collar diameter measurement point was 3.59cm from 6cm underground to the surface and 1.35cm from 0cm to 6cm above ground. The source root collar diameter measurement point difference was larger in the basement than in the ground. The standard deviation of the root collar diameter of the landscape tree was 0.64 from 6cm underground to the surface, and the difference in standard deviation from 0cm to 6cm above ground was 0.16. The difference by measurement point of the root collar diameter was larger in the basement than in the ground. It has been proposed to set the reasonable measurement point of the landscaping tree root collar diameter at the inflection point where the standard deviation of the tree trunk diameter is the smallest in line with the size change of the standard for each root collar diameter measurement point. By tree species, Cornus officinalis Siebold & Zucc. 18cm above the ground, Chionanthus retusus Lindl. & Paxton. 12cm above the ground, Zelkova serrata (Thunb.) Makino. 12cm above the ground, Celtis sinensis Pers. 12cm above the ground, Styrax japonicus Siebold & Zucc. 10 cm above the ground, Cornus officinalis Siebold & Zucc. 10cm above the ground, Acer palmatum Thunb. ex Murray. 6cm above the ground, Ilex rotunda Thunb. 6cm above the ground, Quercus myrsmaefolia Blume. 4cm above the ground, Lagerstroemia indica L. 2cm above the ground The above heights were shown as reasonable measurement points. The difference by landscape tree root collar diameter measurement site showed that the standard deviation was small throughout the tree species, and the reasonable average measurement point with a stable slope of the deviation was 12cm or more on average. It can be said that the reasonable measurement point of the root collar diameter of a landscape tree is set at an average of 12cm above the ground. However, recognizing 30cm, which is a familiar ruler(尺) in traditional practices, is quick, It was recommended to measure at the height of 30cm from the surface for a reasonable measurement point of the root collar diameter of a landscape tree, for the uniformity of measurement standards.

• Management Science and Financial Engineering
• /
• v.20 no.1
• /
• pp.17-19
• /
• 2014

In this paper, we consider an interesting variant of the inverse minimum traveling salesman problem. Given an instance (G, w) of the minimum traveling salesman problem defined on a metric space, we fix a specified Hamiltonian cycle $HC_0$. The task is then to adjust the edge cost vector w to w' so that the new cost vector w' satisfies the triangle inequality condition and $HC_0$ can be returned by the minimum spanning tree algorithm in the TSP-instance defined with w'. The objective is to minimize the total deviation between the original and the new cost vectors with respect to the $L_1$-norm. We call this problem the inverse metric traveling salesman problem against the minimum spanning tree algorithm and show that it is closely related to the inverse metric spanning tree problem.

• Communications for Statistical Applications and Methods
• /
• v.10 no.3
• /
• pp.845-857
• /
• 2003

We explore the use of genetic programming to evolve decision trees directly for classification problems with both discrete and continuous predictors. We demonstrate that the derived hypotheses of standard algorithms can substantially deviated from the optimum. This deviation is partly due to their top-down style procedures. The performance of the system is measured on a set of real and simulated data sets and compared with the performance of well-known algorithms like CHAID, CART, C5.0, and QUEST. Proposed algorithm seems to be effective in handling problems caused by top-down style procedures of existing algorithms.

• Journal of Wetlands Research
• /
• v.21 no.4
• /
• pp.298-304
• /
• 2019

In this paper, the analytical method to derive wind fragility for urban street tree in Korea was shown. Monte Carlo Simulation method was used to determine the probability of failure for urban street tree. This probability result was used to determine wind fragility parameters for four types of tree based on the study of street tree species in urban area in Daegu, Korea. Wind fragility for street tree was presented in terms of median capacity and standard deviation of the natural logarithm of the capacity. Results showed that the dominant factor affecting the probability of failure of tree under wind load was their diameter. Moreover, amongst the four types of tree chosen, the tree with height 7m and diameter 35cm had the lowest probability of failure under wind loading, whereas the tree with height 8m and diameter 30cm could resist the least wind loading. The median failure wind speed for urban street tree with height 7m were 43.8m/s and 50.6m/s for diameter 30cm and 35cm, respectively. Also, for tree with height 8m, their median failure wind speeds were 38.7m/s and 45.4m/s for tree with diameter 30cm and 35cm, respectively.

• Journal of Information Processing Systems
• /
• v.8 no.3
• /
• pp.437-444
• /
• 2012

In this paper, we propose a method for predicting a user's location based on their past movement patterns. There is no restriction on the length of past movement patterns when using this method to predict the current location. For this purpose, a modified search tree has been devised. The search tree is constructed in an effective manner while it additionally learns the movement patterns of a user one by one. In fact, the time complexity of the learning process for a movement pattern is linear. In this process, the search tree expands to take into consideration more details about the movement patterns when a pattern that conflicts with an existing trained pattern is found. In this manner, the search tree is trained to make an exact matching, as needed, for location prediction. In the experiments, the results showed that this method is highly accurate in comparison with more complex and sophisticated methods. Also, the accuracy deviation of users of this method is significantly lower than for any other methods. This means that this method is highly stable for the variations of behavioral patterns as compared to any other method. Finally, 1.47 locations were considered on average for making a prediction with this method. This shows that the prediction process is very efficient.

• Journal of Advanced Navigation Technology
• /
• v.1 no.1
• /
• pp.59-69
• /
• 1997

In this paper, we construct a navigation geography database using R-tree, and develop a software for avionics systems such as VOR, ILS, DME, and NDB. First, we design the navigation geography database using R-tree, and construct a database for navigation aids facilities of every airport. In order to implement avionics software, we develop some calculating algorithms for distance, bearing, and deviation angle between an aircraft and a VOR station for VOR, and deviation angle from a LLZ, glide slope from a GP, and range of markers for ILS. The navigation geography database system is composed of map data manager which can construct and update the database, real-time searcher which provides information about the avionics system, geography database, and user interface.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.6
• /
• pp.139-144
• /
• 2019

For recent decades, Non-volatile Memory (NVM) technologies have been drawing a high attention both in industry and academia due to its high density and short latency comparable to that of DRAM. However, NVM devices has write endurance problem and thus the current data structures that have been built around DRAM-specific features including unlimited program cycles is inadequate for NVM, reducing the device lifetime significantly. In this paper, we revisit a red-black tree extensively adopted for data indexing across a wide range of applications, and make it to better fit for NVM. Specifically, we observe that the conventional red-black tree wears out the specific location of memory because of its rebalancing operation to ensure fast access time over a whole dataset. However, this rebalancing operation frequently updates the long-lived nodes, which leads to the skewed wear out across the NVM cells. To resolve this problem, we present a new swapping wear-leveling red-black tree that periodically moves data in the worn-out node into the young node. The performance study with real-world traces demonstrates the proposed red-black tree reduces the standard deviation of the write count across nodes by up to 12.5%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.10
• /
• pp.1537-1544
• /
• 2022

When designing chip, it considers design specification, timing problem, and clock synchronization on place & route (P&R) process. P&R process is complicated because of considering various factors. Chip uses clock tree synthesis (CTS) to reduce clock path delay. The purpose of this study is to examine shallow-CTS algorithm for checking clock tree synthesizable. Using open source Parser-Verilog, register transfer level (RTL) synthesizable Verilog file is parsed and it uses Pre-CTS and Post-CTS process that is included shallow-CTS. Based on longest clock path in the Pre-CTS and Post-CTS stages, the standard deviation before and after buffer insertion is compared and analyzed for the accuracy of CTS. In this paper, It is expected that the cost and time problem could be reduced by providing a pre-clock tree synthesis verification method at the RTL level without confirming the CTS result using the time-consuming licensed EDA tool.