• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.04a
• /
• pp.274-283
• /
• 2002

This paper presents an efficient models for reinforeced concrete structures using CART-ANFIS(classification and regression tree-adaptive neuro fuzzy inference system). a fuzzy decision tree parttitions the input space of a data set into mutually exclusive regions, each of which is assigned a label, a value, or an action to characterize its data points. Fuzzy decision trees used for classification problems are often called fuzzy classification trees, and each terminal node contains a label that indicates the predicted class of a given feature vector. In the same vein, decision trees used for regression problems are often called fuzzy regression trees, and the terminal node labels may be constants or equations that specify the Predicted output value of a given input vector. Note that CART can select relevant inputs and do tree partitioning of the input space, while ANFIS refines the regression and makes it everywhere continuous and smooth. Thus it can be seen that CART and ANFIS are complementary and their combination constitutes a solid approach to fuzzy modeling.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.766-768
• /
• 2003

Selectivity estimation for spatial query is curial in Spatial Database Management Systems(SDBMS). Many works have been performed to estimate accurate selectivity. Although they deal with some problems such as false-count, multi-count arising from properties of spatial dataset, they can not get such effects in little memory space.* Therefore, we need to compress spatial dataset into little memory. In this paper, we propose a new technique called MW Histogram which is able to compress summary data and get reasonable results. Our method is based on two techniques:(a)MinSkew partitioning algorithm which deal with skewed spatial datasets. efficiently (b) Wavelet transformation which compression effect is proven. We evaluate our method via real datasets. The experimental result shows that the MW Histogram has the ability of providing estimates with low relative error and retaining the similar estimates even if memory space is small.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.9
• /
• pp.335-344
• /
• 2018

The power model is needed to handle the power consumption of mobile AMOLED display at the software level. However, the existing studies to generate the power model have required the experimental environment and equipment for the power measurement activity. In addition, the combination of RGB values used for modeling was imprudent and small, so it was difficult to reflect the mutual influence between the RGB values into the model. To solve these problems, we propose an RGB color space partitioning method, which is used to prudently sample the combinations of the RGB values based on the color or the power. We also propose a process for generating a mapping table composed of . We analyzed the characteristics of the samples generated according to the proposed partitioning methods, taking into account the color and the power, and generated the mapping table for the AMOLED display. Furthermore, we confirmed the reusability of the mapping table by utilizing one mapping table multiple times in evaluating different power models. These mapping tables are provided to researchers and can be used to generate and evaluate power models without power measurement activities.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.12
• /
• pp.889-898
• /
• 2022

In this paper, parallel computing method on the three-dimensional electromagnetic field is proposed. The present electromagnetic scattering analysis is conducted based on the time-harmonic vector wave equation and the finite element method. The edge-based element and 2^nd -order absorbing boundary condition are used. Parallelization of the elemental numerical integration and the matrix assemblage is accomplished by allocating the partitioned finite element subdomain for each processor. The graph partitioning library, METIS, is employed for the subdomain generation. The large sparse matrix computation is conducted by MUMPS, which is the parallel computing library based on the multi-frontal method. The accuracy of the present program is validated by the comparison against the Mie-series analytical solution and the results by ANSYS HFSS. In addition, the scalability is verified by measuring the speed-up in terms of the number of processors used. The present electromagnetic scattering analysis is performed for a perfect electric conductor sphere, isotropic/anisotropic dielectric sphere, and the missile configuration. The algorithm of the present program will be applied to the finite element and tearing method, aiming for the further extended parallel computing performance.

• Journal of KIISE:Software and Applications
• /
• v.36 no.6
• /
• pp.451-461
• /
• 2009

The Adaptive Random Testing(ART) aims to improve the performance of traditional Random Testing(RT) by reducing the number of test cases to find the failure region which is located in the input domain. Such enhancement can be obtained by efficient selection algorithms of test cases. The ART through Iterative Partitioning(IP-ART) is one of ART techniques and it uses an iterative input domain partitioning method to improve the performance of early-versions of ART which have significant drawbacks in computation time. And the IP-ART with Enlarged Input Domain(EIP-ART), an improved version of IP-ART, is known to make additional performance improvement with scalability by expanding to virtual test space beyond real input domain of IP-ART. The EIP-ART algorithm, however, have the drawback of heavy cost of computation time to generate test cases mainly due to the virtual input domain enlargement. For this reason, two algorithms are proposed in this paper to mitigate the computation overhead of the EIP-ART. In the experiments by simulations, the tiling technique of input domain, one of two proposed algorithms, showed significant improvements in terms of computation time and testing performance.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1011-1020
• /
• 2004

A lot of work has been done to improve the I/O performance of such a system that store and manage a massive amount of data by distributing them across multiple disks and access them in parallel. Most of the previous work has focused on an efficient mapping from a grid ceil, which is determined bY the interval number of each dimension, to a disk number on the assumption that each dimension is split into disjoint intervals such that entire data space is GRID-like partitioned. However, they have ignored the effects of a GRID partitioning scheme on declustering performance. In this paper, we enhance the performance of mapping function based declustering algorithms by applying a good GRID par-titioning method. For this, we propose an estimation model to count the number of grid cells intersected by a range query and apply a GRID partitioning scheme which minimizes query result size among the possible schemes. While it is common to do binary partition for high-dimensional data, we choose less number of dimensions than needed for binary partition and split several times along that dimensions so that we can reduce the number of grid cells touched by a query. Several experimental results show that the proposed estimation model gives accuracy within 0.5% error ratio regardless of query size and dimension. We can also improve the performance of declustering algorithm based on mapping function, called Kronecker Sequence, which has been known to be the best among the mapping functions for high-dimensional data, up to 23 times by applying an efficient GRID partitioning scheme.

• Journal of IKEEE
• /
• v.5 no.1 s.8
• /
• pp.100-110
• /
• 2001

In this paper, we investigated several buffer management schemes for the design of shared-memory type ATM switches, which can enhance the utilization of switch resources and can support quality-of-service (QoS) functionalities. Our results show that dynamic threshold (DT) scheme demonstrate a moderate degree of robustness close to pushout(PO) scheme, which is known to be impractical in the perspective of hardware implementation, under various traffic conditions such as traffic loads, burstyness of incoming traffic, and load non-uniformity across output ports. Next, we considered buffer management strategies to support QoS functions, which utilize parameter values obtained via connection admission control (CAC) procedures to set tile threshold values. Through simulations, we showed that the buffer management schemes adopted behave well in the sense that they can protect regulated traffic from unregulated cell traffic in allocating buffer space. In particular, it was observed that dynamic partitioning is superior in terms of QoS support than virtual partitioning.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.1
• /
• pp.93-102
• /
• 1999

In this paper, we propose a data model and a retrieval method for content-based video query After partitioning a video into frame sets of same length which is called video-window, each video-window can be mapped to a point in a multidimensional space. A video can be represented a trajectory by connection of neighboring video-window in a multidimensional space. The similarity between two video-windows is defined as the euclidean distance of two points in multidimensional space, and the similarity between two video segments of arbitrary length is obtained by comparing corresponding trajectory. A new retrieval method with filtering and refinement step if developed, which return correct results and makes retrieval speed increase by 4.7 times approximately in comparison to a method without filtering and refinement step.

• Journal of Korea Multimedia Society
• /
• v.9 no.12
• /
• pp.1607-1616
• /
• 2006

The growing market of multimedia and digital signal processing requires significant data-path portions of SoCs. However, the common models for verification are not suitable for SoCs. A novel model--WGL (Weighted Generalized List) is proposed, which is based on the general-list decomposition of polynomials, with three different weights and manipulation rules introduced to effect node sharing and the canonicity. Timing parameters and operations on them are also considered. Examples show the word-level WGL is the only model to linearly represent the common word-level functions and the bit-level WGL is especially suitable for arithmetic intensive circuits. The model is proved to be a uniform and efficient model for both bit-level and word-level functions. Then Based on the WGL model, a backward-construction logic-verification approach is presented, which reduces time and space complexity for multipliers to polynomial complexity(time complexity is less than $O(n^{3.6})$ and space complexity is less than $O(n^{1.5})$) without hierarchical partitioning. Finally, a construction methodology of word-level polynomials is also presented in order to implement complex high-level verification, which combines order computation and coefficient solving, and adopts an efficient backward approach. The construction complexity is much less than the existing ones, e.g. the construction time for multipliers grows at the power of less than 1.6 in the size of the input word without increasing the maximal space required. The WGL model and the verification methods based on WGL show their theoretical and applicable significance in SoC design.

• Nuclear Engineering and Technology
• /
• v.41 no.9
• /
• pp.1143-1156
• /
• 2009

The SPACE code that is based on a multi-dimensional two-fluid, three-field model is under development for licensing purposes of pressurized water reactors in Korea. Among the participating research and industrial organizations, KAERI is in charge of developing the physical models and correlation packages for the constitutive equations. This paper introduces a developed wall-to-fluid heat transfer package for the SPACE code. The wall-to-fluid heat transfer package consists of twelve heat transfer subregions. For each sub-region, the models in the existing safety analysis codes and the leading models in literature have been peer reviewed in order to determine the best models which can easily be applicable to the SPACE code. Hence a wall-to-fluid heat transfer region selection map has been developed according to the non-condensable gas quality, void fraction, degree of subcooling, and wall temperature. Furthermore, a partitioning methodology which can take into account the split heat flux to the continuous liquid, entrained droplet, and vapor fields is proposed to comply fully with the three-field formulation of the SPACE code. The developed wall-to-fluid heat transfer package has been pre-tested by varying the independent parameters within the application range of the selected correlations. The smoothness between two adjacent heat transfer regimes has also been investigated. More detailed verification work on the developed wall-to-fluid heat transfer package will be carried out when the coupling of a hydraulic solver with the constitutive equations is brought to completion.