• The KIPS Transactions:PartD
• /
• v.16D no.4
• /
• pp.475-486
• /
• 2009

Data cube plays an important role in multi-dimensional, multi-level data analysis. Meeting on-line analysis requirements of data stream, several cube structures have been proposed for OLAP on data stream, such as stream cube, flowcube, S-cube. Since it is costly to construct data cube and execute ad-hoc OLAP queries, more research works should be done considering efficient data structure, query method and algorithms. Stream cube uses H-cubing to compute selected cuboids and store the computed cells in an H-tree, which form the cuboids along popular-path. However, the H-tree layoutis disorderly and H-cubing method relies too much on popular path.In this paper, first, we propose $H^*$-tree, an improved data structure, which makes the retrieval operation in tree structure more efficient. Second, we propose an improved cubing method, $H^*$-cubing, with respect to computing the cuboids that cannot be retrieved along popular-path when an ad-hoc OLAP query is executed. $H^*$-tree construction and $H^*$-cubing algorithms are given. Performance study turns out that during the construction step, $H^*$-tree outperforms H-tree with a more desirable trade-off between time and memory usage, and $H^*$-cubing is better adapted to ad-hoc OLAP querieswith respect to the factors such as time and memory space.

• Spatial Information Research
• /
• v.19 no.5
• /
• pp.63-74
• /
• 2011

Recently, there has been much interest in the spatial query which energy-efficiently acquires sensor readings from sensor nodes inside specified geographical area of interests. The centralized approach which performs the spatial query at a server after acquiring all sensor readings, though simple, it incurs high wireless transmission cost in accessing all sensor nodes. In order to remove the high wireless transmission cost, various in-network spatial indexing schemes have been proposed. They have focused on reducing the transmission cost by performing distributed spatial filtering on sensor nodes. However, these in-network spatial indexing schemes have a problem which cannot optimize both the spatial filtering and the wireless routing among sensor nodes, because these schemes have been developed by simply applying the existing spatial indexing schemes into the in-network environment. Therefore, we propose a new distributed spatial indexing scheme of the GR-tree. The GR-tree which form s a MBR-based tree structure, can reduce the wireless transmission cost by optimizing both the efficient spatial filtering and the wireless routing. Finally, we compare the existing spatial indexing scheme through extensive experiments and clarify our approach's distinguished features.

• Structural Engineering and Mechanics
• /
• v.84 no.5
• /
• pp.605-618
• /
• 2022

Glass fiber reinforced polymer (GFRP) elastic gridshells consist of long continuous GFRP tubes that form elastic deformations. In this paper, a method for the form-finding of gridshell structures is presented based on the interpretable machine learning (ML) approaches. A comparative study is conducted on several ML algorithms, including support vector regression (SVR), K-nearest neighbors (KNN), decision tree (DT), random forest (RF), AdaBoost, XGBoost, category boosting (CatBoost), and light gradient boosting machine (LightGBM). A numerical example is presented using a standard double-hump gridshell considering two characteristics of deformation as objective functions. The combination of the grid search approach and k-fold cross-validation (CV) is implemented for fine-tuning the parameters of ML models. The results of the comparative study indicate that the LightGBM model presents the highest prediction accuracy. Finally, interpretable ML approaches, including Shapely additive explanations (SHAP), partial dependence plot (PDP), and accumulated local effects (ALE), are applied to explain the predictions of the ML model since it is essential to understand the effect of various values of input parameters on objective functions. As a result of interpretability approaches, an optimum gridshell structure is obtained and new opportunities are verified for form-finding investigation of GFRP elastic gridshells during lifting construction.

• Journal of the Korean Society for Marine Environment & Energy
• /
• v.9 no.2
• /
• pp.92-97
• /
• 2006

Hull forms of a high speed small boat have been developed through numerical studies. A round bilge type hull form has been drived form a using chine hull form with HCAD, a hull form variation software. Wave resistance and the flow fields around the ships have been computed using well-known software, WAVIS. This software employs Rankine source method with non-linear tree surface condition as well as dry transom boundary conditions. The round bilge hull form showed better resistance performance than to the chine hull form for the whole speed range. However, considering the building and labor costs of the small shipyard, the chine hull form has been selected and its wave resistance characteristics has been improved by modifying the bow regions and applying the stem wedge. It is found that the effect of stem wedge is quite satisfactory to improve the resistance characteristics of high speed chine hull form.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.388-398
• /
• 2011

In this paper, we introduce an EMSP(Efficient Mobility Support Protocol) for mobile sensor network with mobility-aware. We propose virtual cluster and node split scheme considering movements of mobile nodes. The existing M-LEACH protocol suffers from communication cost spent on JOIN request information during invitation phase. To address this issue, the large boundary of the cluster in LUR-tree can reduce superfluous update cost. In addition to the expansion of the cluster, the proposed approach exploits node split algorithms used in R-tree in order to uniformly form a cluster. The simulated results show that energy-consumption has less up to about 40% than LEACH-C and 8% than M-LEACH protocol. Finally, we show that the proposed scheme outperforms those of other in terms of lifetime of sensor fields and scalability in wireless sensor network.

• Journal of Digital Convergence
• /
• v.11 no.9
• /
• pp.153-158
• /
• 2013

Target learning model is not recognized in this category or not classified clearly failed to determine if the vocabulary recognition is reduced. Form of classification learning model is changed or a new learning model is added to the recognition decision tree structure of the model should be changed to a structural problem. In order to solve these problems, a decision tree learning model for classification learning algorithm is proposed. Phonological phenomenon reflected sound enough to configure the database to ensure learning a decision tree learning model for classifying method was used. In this study, the indoor environment-dependent recognition and vocabulary words for the experimental results independent recognition vocabulary of the indoor environment-dependent recognition performance of 98.3% in the experiment showed, vocabulary independent recognition performance of 98.4% in the experiment shown.

• Journal of Forest and Environmental Science
• /
• v.10 no.1
• /
• pp.8-24
• /
• 1994

Because of the underground existence of roots, a few studies have been reported on root system. The developmental information of roots should be understood for the studies of specific tree traits and the influence of such traits on the soil surface fixation. In order to clarify the specific character of pine forest in Kangwon Province, the investigation on the form and distribution of root system of pine trees were carried out for 5 trees in the Campus Forest, Kangwon National Univ.. Root form was very well in flat root. As soil depth was approximatly 50cm, fine roots were very sparsly distributed(+), roots of 0.2cm in diameter were most common and roots > 0.2cm were very rare, also thickness thined. 60~70% all the roots were developed at the depth of 0~30cm, where big roots were below 0.9cm in diameter and fine roots were higly sparse(+).

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.5
• /
• pp.516-522
• /
• 2020

Water trees can cause considerable damage to the performance of underground cables. Theymay formwithin the dielectric used in buried or water-immersed high voltage cables. They grow in a bush-like or tree-like form, often taking decades before causing damage to a cable's performance. They are usually found on very old underground cables, often in an inaccessible place. It is costly and time-consuming to detect watertrees in underground cables. Tree detection technology, including mathematical modeling,can reduce the maintenance cost and time necessary for detecting these trees.To simulate detection of water trees in this study, a mathematical model ofan XLPE cable and a water tree were developed. The complex water tree structure was simplified, based on two identified patterns of aventedtree. A Matlab simulation was performed to calculate and analyze the capacitance and resistance of a cable insulation layer,based on growth of a watertree. Capacitance size increased about 0.025×10^-13[Farads/mm] compared to normal when the tree area of the cable was advanced to 95% of the insulation layer. The resistance value decreased by about 0.5×10¹⁶[ohm/m]. These changesand changesshowninaBurkes paper physical modeling simulation are similar.The value of mathematical modeling for detecting water trees and damage to underground cables has been demonstrated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.714-727
• /
• 2015

The hierarchical structure in networks is widely applied in many practical scenarios especially in some emergency cases. In this paper, we focus on a tree network with and without packet loss where one source sends data to n destinations, through m relay nodes employing random linear network coding (RLNC) over a Galois field in parallel transmission systems. We derive closed-form probability expressions of successful decoding at a destination node and at all destination nodes in this multicast scenario. For the convenience of computing, we also propose an upper bound for the failure probability. We then investigate the impact of the major parameters, i.e., the size of finite fields, the number of internal nodes, the number of sink nodes and the channel failure probability, on the decoding performance with simulation results. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized. When failure decoding probabilities are given, the operation is simple and its complexity is low in a small finite field.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.26 no.2
• /
• pp.133-142
• /
• 1998

This paper reviews the difference between the selected village groves and seaside groves in Chonbuk-Do province. In Chonbuk-Do province, village groves were principally found in the east mountainous region and seaside groves were found only in the south seaside. The village groves were located in the roadside and village entrance, but seaside groves were located in the front of crop land for the purpose of windbreak. The planting motive of village groves was historical and cultural background, but that of seaside groves was protection of cropland and village from strong wind. The form of village groves was various, but that of seaside groves was linear and rectangular. Both were small scale in comparison with other province. Both were formed on the slopeless land. In ownership, the rate of seaside groes owned by the slf governing body is higher than village groves. Billage groves were almostly owned by village. In vegetatioin structure, both were one class forest composed of only tall tree of upper class. Principal dominent species of seaside groves in upper tree was Pinus thunbergii, but those of village groves were Pinus densiflora, Carpinus tschonoskii, Zelkova serrata etc. Seaside groves were not growing normally in aspect of height and breast diameter of tree in comparison with village groves. The planting density of seaside groves was 3.7 times higher than village groves in Chonbuk-Do province.