• Journal of the East Asian Society of Dietary Life
• /
• v.6 no.2
• /
• pp.235-255
• /
• 1996

Natural substances, exploited in our daily life, have been applied to drugs to treat diseases and developed to functional foods by appropriate preparations, and these foods give beneficial effects on physical activities. In this paper, the utilization of traditional functional foods was studied with refer ring to old ancient writings published in the front-end of Chosun dynasty. The utilized vegetables were march mallow, turnip, radish, Chinese cabbage, lettuce, spinach, cucumber winter buds, flesh of a cabbage, eggplant, taro, burdock, Parsley, watershield plant, crown daisy, bamboo shoots, garlic, scallion, onion, acorn, bark of a tree, white goosefoot leaf, leaf of bean, pine mushroom, bracken. yam, mugwort, tea, ginseng, peppermint, fruit of the Maximowiczia chinensis, smartweed and pepper. The utilized fruits were chestnut, Chinese date, pine nuts, walnut, gingko nut, citrus. crab apple, pear, peach, grape, pomegranate, plum, Chinese quince, fig and watermelon. The utilized cereal were rice, barley, bean, buckweat and Job's-tears. The utilized sweetenings and seasonings were honey, wheat-gluten, sugar, oil, salt, soy sauce and vinegar. Our ancestors had a balanced diet using the various foods, and especially had a fundamental concept of "Foods have the efficacy of a remedy".edy".uot;.

• Convergence Security Journal
• /
• v.6 no.2
• /
• pp.53-60
• /
• 2006

In the applications such as CAD or image processing, a variety of geometric objects are manipulated. A polygon in which all the edges are parallel to x- or y-axis is decomposed into simple rectangles for efficient handling. But, depending on the partitioning algorithms, the same region can be decomposed into a completely different set of rectangles in the number, size and shape of rectangles. So, it is necessary an algorithm that compares two sets of rectangles extracted from two scenes such as CAD or image to see if they represent the same region. This paper proposes an efficient algorithm that compares two sets of rectangles. The proposed algorithm is not only simpler than the algorithm based on sweeping method, but also reduces the number $O(n^2)$ of overlapped rectangles from the algorithm based on a balanced binary tree to O(nlogn).

• ETRI Journal
• /
• v.33 no.3
• /
• pp.344-354
• /
• 2011

In this paper, a model is introduced named double relation chains (DRC) based on ordered sets. It is proved that using DRC and special relationships among the members of an alphabet, vectors of this alphabet can be stored and searched in a tree. This idea is general; however, one special application of DRC is the longest prefix matching (LPM) problem in an IP network. Applying the idea of DRC to the LPM problem makes the prefixes comparable like numbers using a pair of w-bit vectors to store at least one and at most w prefixes, where w is the IP address length. This leads to good compression performance. Based on this, two recently introduced structures called coded prefix trees and scalar prefix trees are shown to be specific applications of DRC. They are implementable on balanced trees which cause the node access complexity for prefix search and update procedures to be O(log n) where n is the number of prefixes. As another advantage, the number of node accesses for these procedures does not depend on w. Additionally, they need fewer number of node accesses compared to recent range-based solutions. These structures are applicable on both IPv4 and IPv6, and can be implemented in software or hardware.

• Earthquakes and Structures
• /
• v.27 no.3
• /
• pp.177-189
• /
• 2024

Accurately predicting the failure modes of reinforced concrete (RC) columns is essential for structural design and assessment. In this study, the challenges of imbalanced datasets and complex feature selection in machine learning (ML) methods were addressed through an optimized ML approach. By combining feature selection and oversampling techniques, the prediction of seismic failure modes in rectangular RC columns was improved. Two feature selection methods were used to identify six input parameters. To tackle class imbalance, the Borderline-SMOTE1 algorithm was employed, enhancing the learning capabilities of the models for minority classes. Eight ML algorithms were trained and fine-tuned using k-fold shuffle split cross-validation and grid search. The results showed that the artificial neural network model achieved 96.77% accuracy, while k-nearest neighbor, support vector machine, and random forest models each achieved 95.16% accuracy. The balanced dataset led to significant improvements, particularly in predicting the flexure-shear failure mode, with accuracy increasing by 6%, recall by 8%, and F1 scores by 7%. The use of the Borderline-SMOTE1 algorithm significantly improved the recognition of samples at failure mode boundaries, enhancing the classification performance of models like k-nearest neighbor and decision tree, which are highly sensitive to data distribution and decision boundaries. This method effectively addressed class imbalance and selected relevant features without requiring complex simulations like traditional methods, proving applicable for discerning failure modes in various concrete members under seismic action.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.2
• /
• pp.16-27
• /
• 2011

Embryo is a very early stage of the development of multicellular organism such as animals and plants. It is an important research target for studying ontogeny because the fundamental body system of multicellular organism is determined during an embryo state. Researchers in the developmental biology have a large volume of embryo image databases for studying embryos and they frequently search for an embryo image efficiently from those databases. Thus, it is crucial to organize databases for their efficient search. Hierarchical clustering methods have been widely used for database organization. However, most of previous algorithms tend to produce a highly skewed tree as a result of clustering because they do not simultaneously consider both the size of a cluster and the number of objects within the cluster. The skewed tree requires much time to be traversed in users' search process. In this paper, we propose a method that effectively organizes a large volume of embryo image data in a balanced tree structure. We first represent embryo image data as a similarity-based graph. Next, we identify clusters by performing a graph partitioning algorithm repeatedly. We check constantly the size of a cluster and the number of objects, and partition clusters whose size is too large or whose number of objects is too high, which prevents clusters from growing too large or having too many objects. We show the superiority of the proposed method by extensive experiments. Moreover, we implement the visualization tool to help users quickly and easily navigate the embryo image database.

• Korean Journal of Environment and Ecology
• /
• v.33 no.6
• /
• pp.695-707
• /
• 2019

This study was intended to suggest the appropriate vegetation management methodology by analyzing phytosociology for ecotourism resources. We carried out the classification and interpretation of the vegetation structure and the analysis of the relationship between communities and environmental conditions in Pocheon valley, Mt. Gaya. The vegetation in Pocheon valley was composed of 5 communities: Pinus densiflora-Quercus mongolica community, Quercus serrata-Quercus variabilis community, Larix kaempferi-Quercus serrata community, Pinus densiflora-Castanea crenata community, and Salix gracilistyla-Phragmites japonica community. The Quercus serrata-Quercus variabilis community was further segmented into two types according to the differences of composition species and location of habitats. The methodologies that satisfy both the use of nature for ecotourism resources and the sustentation of natural vegetation are as follows: - maintenance the present vegetation (dominance species) by strictly avoiding artificial management in the tree layer; - maintenance of the existing vegetation structure through the artificial management of the usual vigorous tree species when the species in the shrub layer grow up to the subtree layer; and - continued artificial management to maintain high balanced diversity and evenness of various species in shrub and herb layers.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.11
• /
• pp.245-253
• /
• 2011

Due to the imprudent spending of the fossil fuels, the environment was contaminated seriously and the exhaustion problems of the fossil fuels loomed large. Therefore people become taking a great interest in alternative energy resources which can solve problems of fossil fuels. The wind power energy is one of the most interested energy in the new and renewable energy. However, the plants of wind power energy and the traditional power plants should be balanced between the power generation and the power consumption. Therefore, we need analysis and prediction to generate power efficiently using wind energy. In this paper, we have performed a research to predict power generation patterns using the wind power data. Prediction approaches of datamining area can be used for building a prediction model. The research steps are as follows: 1) we performed preprocessing to handle the missing values and anomalous data. And we extracted the characteristic vector data. 2) The representative patterns were found by the MIA(Mean Index Adequacy) measure and the SOM(Self-Organizing Feature Map) clustering approach using the normalized dataset. We assigned the class labels to each data. 3) We built a new predicting model about the wind power generation with classification approach. In this experiment, we built a forecasting model to predict wind power generation patterns using the decision tree.

• The Journal of the Korea Contents Association
• /
• v.8 no.10
• /
• pp.20-26
• /
• 2008

The quality of stream remaking is decided the load of a server and Jitter through the traffic of the transmission path between end to end. In order to improve these problems in this paper, I propose tree construction method of low-delay-level-multicast. In this case which the network congestion will be occurred by streaming quality, I also propose the technique which dynamically changes the transmission path. This technique first constructs the overlay structure for relaxing the overload of server. Secondly, in order to decrease Jitter of client, it makes upload bandwidth and low latency balanced. In the evaluation of the performance, this paper showed better enhancement of about $15%{\sim}24%$ than P2CAST[4] in the simulation about node average join count, average bandwidth, service request refusal ratio, RTT measurement of nodes, and node average join count by defect ratio.

• Korean Journal of Heritage: History & Science
• /
• v.46 no.4
• /
• pp.48-63
• /
• 2013

The results of the study on the space planning and landscape design of Unjoru(雲鳥樓) through the 'Jeolla Gurye Omidong Gado(全羅求禮五美洞家圖)' drawn using GyeHwa(界畵) technique are as follows. First, 'Omidong Gado' is believed to date back to the period when Unjoru(1776~1783) was established for the following reasons: (1) The founder, Yoo-IJu(柳爾?), sent the drawing for the house while he was serving as the governor of YongCheon county(龍川府史). (2) It shows the typical dwelling houses' space division and its location is in a good spot with mountain in the back and water in front(背山臨水) and there is every indication of scheme drawing. (3) Front gate was changed and remodeled to a lofty gate in 1804. Second, Nogodan & Hyeongjebong of Jiri Mountain sit at the back of Unjoru, and faces Obong mountain and Gyejok mountain. In addition, the Dongbang stream flowing to the east well illustrates the Pungsu theory of mountain in the back and water in the front. Third, the house is structured in the shape resembling the character 品, divided into 5 areas by hierarchical order in the cross line from all directions. The site, which includes the outdoor yard and the back garden, consists of 5 blocks, 6 yards and 2 gardens. Fourth, the outdoor yard with aesthetical value and anti-fire function, is an ecological garden influenced by Confucianism and Taoism with a pond (BangJiWonDo Type, 方池圓島形) at the center. Fifth, the Sarang yard(舍廊庭) is decorated with terrace garden and flower garden, and the landscaping components such as oddly shaped stone, crane, plum, pine tree, tamarisk tree and flowering plants were used to depict the ideal fairy land and centrally placed tree for metaphysical symbolism. The upper floor of Sarangchae commands distant and medium range view, as well as upwards and downwards. The natural landscape intrudes inside, and at the same time, connects with the outside. Sixth, pine forest over the northern wall and the intentionally developed low hill are one of the traditional landscaping techniques that promotes pleasant residential environment as well as the aesthetics of balanced fullness.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.665-670
• /
• 2003

In the applications like automatic masks generation for semiconductor production, a drawing consists of lots of polygons that are partitioned into trapezoids. The addition/deletion of a polygon to/from the drawing is performed through geometric operations such as insertion, deletion, and search of trapezoids. Depending on partitioning algorithm being used, a polygon can be partitioned differently in terms of shape, size, and so on. So, It's necessary to invent some comparison algorithm of sets of trapezoids in which each set represents interested parts of a drawing. This comparison algorithm, for example, may be used to verify a software program handling geometric objects consisted of trapezoids. In this paper, given k sets of trapezoids in which each set forms the regions of interest of each drawing, we present how to compare the k sets to see if all k sets represent the same geometric scene. When each input set has the same number n of trapezoids, the algorithm proposed has O(2$^{k-2}$ $n^2$(log n＋k)) time complexity. It is also shown that the algorithm suggested has the same time complexity O( $n^2$ log n) as the sweeping-based algorithm when the number k(<< n) of input sets is small. Furthermore, the proposed algorithm can be kn times faster than the sweeping-based algorithm when all the trapezoids in the k input sets are almost the same.