• Proceedings of the Korea Electromagnetic Engineering Society Conference
• /
• 2005.11a
• /
• pp.163-168
• /
• 2005

Attenuation in vegetation is important, for both terrestrial and earth-space systems. However, the wide range of conditions and types of foliage makes it difficult to develop a generalized prediction procedure. Currently, there is also a lack of suitably prediction model and measured experimental data for vegetation loss. So in this paper, vegetation loss data for four different tree-species, including Dawn-redwood tree, Plane tree, Pine tree and Fir tree are obtained by measurement in the frequency range of 1.0 $\sim$ 6.0 GHz. The through or scattered component is calculated using a model based upon the theory of RET(Radiative Energy Transfer) and RET modeling parameters are extracted from the measured data.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.1
• /
• pp.30-36
• /
• 2001

We present a new algorithm for mining association rules in the large database. Association rules are the relationships of items in the same transaction. These rules provide useful information for marketing. Since Apriori algorithm was introduced in 1994, many researchers have worked to improve Apriori algorithm. However, the drawback of Apriori-based algorithm is that it scans the transaction database repeatedly. The algorithm which we propose scans the database twice. The first scanning of the database collects frequent length l-itemsets. And then, the algorithm scans the database one more time to construct the data structure Common-Item Tree which stores the information about frequent itemsets. To find all frequent itemsets, the algorithm scans Common-Item Tree instead of the database. As scanning Common-Item Tree takes less time than scanning the database, the algorithm proposed is more efficient than Apriori-based algorithm.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2008.03a
• /
• pp.1365-1371
• /
• 2008

Based on the data obtained from field investigation and soil testing to slope hazards occurrence section and non-occurrence section in gneiss area, a prediction technique was developed by the use of a decision tree model. The slope hazards data of Seoul and Kyonggi Province were 104 sections in gneiss area. The number of data applied in developing prediction model was 61 sections except a vacant value. The statistical analyses using the decision tree model were applied to the entrophy index. As the results of analyses, a slope angle, a degree of saturation and an elevation were selected as the classification standard. The prediction model of decision tree using entrophy index is most likely accurate. The classification standard of the selected prediction model is composed of the slope angle, the degree of saturation and the elevation from the first choice stage. The classification standard values of the slope angle, the degree of saturation and elevation are $17.9^{\circ}$, 52.1% and 320m, respectively.

• Convergence Security Journal
• /
• v.17 no.1
• /
• pp.3-13
• /
• 2017

As security log plays important roles in various fields, the integrity of log data become more and more important. Especially, the stored log data is an immediate target of the intruder to erase his trace in the system penetrated. Several theoretical schemes to guarantee the forward secure integrity have been proposed, even though they cannot provide the integrity of the log data after the system is penetrated. Authentication tags of these methods are based on the linear-hash chain. In this case, it is difficult to run partial validation and to accelerate generating and validating authentication tags. In this paper, we propose a log authentication mechanism, based on Mekle Tree, which is easy to do partial validation and able to apply multi threading.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.108-110
• /
• 2019

A Database is a collection of data that does not have redundancy, and it is essential to easily use and share information in an information society where the amount of information is increasing. A typical structure of a Database is a relational database and a tree-structure Database. This research studies the programming language MUMPS, which is a tree structure database. This language constructs the database by storing arrays in a dynamic or B-Tree format. Unlike SQL, which must be used in languages such as Java and C #, MUMPS supports language and database independently and can manage data, so the data porting rate is high. In fact, in U.S. hospitals, the MUMPS-based platform has a high market share.

• Journal of the Korean Society of Safety
• /
• v.15 no.1
• /
• pp.100-105
• /
• 2000

Correlation between propagation of bush-type electrical tree and internal partial discharges(PD) was discussed. We used specimens with needle-plane electrode system made of LDPE(Low Density Polyethylene), observed inception and propagation of electrical tree by optical microscope interfaced with computer and investigated characteristics of phase resolved PD pulses accompanying with propagation of electrical tree. Electrical tree generally growed bush-type tree. PD data detected and analyzed were average discharge current and statistical operator of q-n, $\psi$- $q_{avg}$, $\psi$-n, ${\psi}-q_{max}$ distribution. Parameters used were skewness, kurtosis, average discharge phase, cross-correlation factor, asymmetry and etc. In generally, average discharge current had good linear relationship with propagation of bush type electrical tree on this experiment. Peak discharge magnitude and repetition rate were increased, but they had not good linear relationship.p.

• Journal of Korea Multimedia Society
• /
• v.10 no.3
• /
• pp.358-364
• /
• 2007

This paper suggests MPLS restoration method that use an aggregation tree. For the restoration of the MPLS network, this paper presents a scheme that reconstruct multiple path through aggregation tree that grow from many node to a target node. Contrary to a multicast tree where a message that send at one node is passed to a group of node, an aggregation tree is a tree that data is passed from many node to one destination node. Through an experiment we confirmed that the restoration scheme that uses aggregation tree shows taster speed comparing with the existing other restoration scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.2 no.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.

• Journal of the Korea Furniture Society
• /
• v.23 no.4
• /
• pp.479-484
• /
• 2012

Tree-ring dating can be used to date scientifically prehistoric timbers, historical buildings or woodcrafts. It gives a calendar year to each tree ring and produces the felling dates of logs or wood panels. In this study, we applied tree-ring dating to a medicine cabinet in Seoul Museum of History. We obtained tree-ring data from radial or cross section by taking photographs with a digital camera. The cabinet were dated A.D. 1821 to the last ring. It was about 50 year older than the previous medicine cabinets. Tree-ring patterns indicated that the origin of woods for the cabinet would be near Sorak mountains.

• Journal of KIISE:Databases
• /
• v.35 no.3
• /
• pp.218-230
• /
• 2008

The temporal aggregate in temporal databases is an extension of the conventional aggregate to include the time on the range condition of aggregation. It is a useful operation for Historical Data Warehouses, Call Data Records, and so on. In this paper, we propose a structure for the temporal aggregation with multiple selection predicates, called the ITA-tree, and an aggregate processing method based on the structure. In the ITA-tree, we transform the time interval of a record into a single value, called the T-value. Then, we index records according to their T-values like a $B^+$-tree style. For possible hot-spot situations, we also propose an improvement of the ITA-tree, called the eITA-tree. Through analyses and experiments, we evaluate the performance of the proposed method.