• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.10
• /
• pp.1561-1570
• /
• 1997

This study explores the treatment of the max-value cost function over a parameter interval in parametric optimization. To avoid the computational burden of the transformation treatment using an artificial variable, a direct treatment of the original max-value cost function is proposed. It is theoretically shown that the transformation treatment results in demanding an additional equality constraint of dual variables as a part of the Kuhn-Tucker necessary conditions. Also, it is demonstrated that the usability and feasibility conditions on the search direction of the transformation treatment retard convergence rate. To investigate numerical performances of both treatments, typical optimization algorithms in ADS are employed to solve a min-max steady-state response optimization. All the algorithm tested reveal that the suggested direct treatment is more efficient and stable than the transformation treatment. Also, the better performing of the direct treatment over the transformation treatment is clearly shown by constrasting the convergence paths in the design space of the sample problem. Six min-max transient response optimization problems are also solved by using both treatments, and the comparisons of the results confirm that the performances of the direct treatment is better than those of the tranformation treatment.

• Structural Monitoring and Maintenance
• /
• v.4 no.1
• /
• pp.33-52
• /
• 2017

A cantilever beam with a breathing crack is studied to improve the breathing crack identification sensitivity by the parametric optimization of sample entropy and wavelet transformation. Crack breathing is a special bi-linear phenomenon experienced by fatigue cracks which are under dynamic loadings. Entropy is a measure, which can quantify the complexity or irregularity in system dynamics, and hence employed to quantify the bi-linearity/irregularity of the vibration response, which is induced by the breathing phenomenon of a fatigue crack. To improve the sensitivity of entropy measurement for crack identification, wavelet transformation is merged with entropy. The crack identification is studied under different sinusoidal excitation frequencies of the cantilever beam. It is found that, for the excitation frequencies close to the first modal frequency of the beam structure, the method is capable of detecting only 22% of the crack depth percentage ratio with respect to the thickness of the beam. Using parametric optimization of sample entropy and wavelet transformation, this crack identification sensitivity is improved up to 8%. The experimental studies are carried out, and experimental results successfully validate the numerical parametric optimization process.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.3
• /
• pp.1-7
• /
• 1999

In this research, transformation-based optimization techniques for pipelined designs have been developed. The transformation-based optimization techniques include pipelined architecture transformations and retiming transformations. The new transformation method has the following three features. First, the overall performance of a pipelined system is optimized owing to various transformations including retiming of multiple pipelined blocks. Second, these techniques can be used to search a large solution space by allowing efficient exploration of trade-offs between area and performance. Third, these techniques can be easily extended to a new transformation or algorithm and can be used to optimize memory or bus architectures. Experimental results illustrate that these transformation-based optimization techniques improve area by 21% and performance by 17% on the average for a set of pipelined designs. Especially, the techniques are useful to efficiently explore a large design space.

• Proceedings of the KIEE Conference
• /
• 2001.07e
• /
• pp.7-12
• /
• 2001

A large number of methods for the design optimization have been proposed in recent years. However, it is not easy to apply these methods to practical use because of many iterations. So, in the design optimization, physical and engineering investigation of the given model are very important, which results in an overall increase in the optimization speed. This paper describes a novel optimization procedure utilizing the conformal transformation method. This approach consists of two phases and has the advantage of grasping the physical phenomena of the model easily. Some numerical results that demonstrate the validity of the proposed method are also presented.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.10a
• /
• pp.323-335
• /
• 1999

In this paper, we propose a new hybrid model of artificial neural networks(ANNs) and genetic algorithm (GA) to optimal feature transformation and feature weighting. Previous research proposed several variants of hybrid ANNs and GA models including feature weighting, feature subset selection and network structure optimization. Among the vast majority of these studies, however, ANNs did not learn the patterns of data well, because they employed GA for simple use. In this study, we incorporate GA in a simultaneous manner to improve the learning and generalization ability of ANNs. In this study, GA plays role to optimize feature weighting and feature transformation simultaneously. Globally optimized feature weighting overcome the well-known limitations of gradient descent algorithm and globally optimized feature transformation also reduce the dimensionality of the feature space and eliminate irrelevant factors in modeling ANNs. By this procedure, we can improve the performance and enhance the generalisability of ANNs.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.16 no.1
• /
• pp.36-43
• /
• 2016

The transformation time among queries in the database management system (DBMS) is responsible for the execution time of users' queries, because a conventional DBMS does not consider the transformation cost when queries are transformed for execution. To reduce the transformation time (cost reduction) during execution, we propose an optimal query transformation method by exploring queries from a cost-based point of view. This cost-based point of view means considering the cost whenever queries are transformed for execution. Toward that end, we explore and compare set off heuristic, linear, and exhaustive cost-based transformations. Further, we describe practical methods of cost-based transformation integration and some query transformation problems. Our results show that, some cost-based transformations significantly improve query execution time. For instance, linear and heuristic transformed queries work 43% and 74% better than exhaustive queries.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.1
• /
• pp.28-36
• /
• 2002

Regarding efficient development of computer graphic animations, lots of techniques for editing or transforming existing motion data have been developed. Basically, the motion transformation techniques follow optimization process. To make the animation be natural, almost all the techniques utilize kinematics and dynamics in constructing constraints for the optimization. Since the kinematic and dynamic structures of virtual characters to be animated are very complex, the most time-consuming part is known to the optimization process. In order to suggest some guide lines to engineers involved in the motion transformation, in this paper, we analyze the computational complexities for typical motion transformation in quantitative manner as well as the possibility for parallel computation.

• Journal of Computing Science and Engineering
• /
• v.3 no.1
• /
• pp.27-58
• /
• 2009

Aggregation join queries are an important class of queries over data streams. These queries involve both join and aggregation operations, with window-based joins followed by an aggregation on the join output. All existing research address join query optimization and aggregation query optimization as separate problems. We observe that, by putting them within the same scope of query optimization, more efficient query execution plans are possible through more versatile query transformations. The enabling idea is to perform aggregation before join so that the join execution time may be reduced. There has been some research done on such query transformations in relational databases, but none has been done in data streams. Doing it in data streams brings new challenges due to the incremental and continuous arrival of tuples. These challenges are addressed in this paper. Specifically, we first present a query processing model geared to facilitate query transformations and propose a query transformation rule specialized to work with streams. The rule is simple and yet covers all possible cases of transformation. Then we present a generic query processing algorithm that works with all alternative query execution plans possible with the transformation, and develop the cost formulas of the query execution plans. Based on the processing algorithm, we validate the rule theoretically by proving the equivalence of query execution plans. Finally, through extensive experiments, we validate the cost formulas and study the performances of alternative query execution plans.

• Korean Journal of Geomatics
• /
• v.5 no.1
• /
• pp.21-26
• /
• 2005

According to revisions of survey law taking effect on January 1, 2003, the Korean geodetic datum has been changed from a local geodetic to a world geodetic system. In this study, the datum transformation parameters especially for the maritime geographical data are determined. From database constructed through MGIS, a total of 492 coordinate pairs were selected and used in the parameter determination after outlier testing. Based on the parameter estimation, the Molodensky model is selected for datum transformation. For higher accuracy, Application of network optimization and a least squares collocation with Gaussian model has resulted in the accuracy better than 15 cm in coordinate transformation.

• Proceedings of the KSME Conference
• /
• 2003.04a
• /
• pp.1262-1269
• /
• 2003

In structural optimization, static loads are generally utilized although real external forces are dynamic. Dynamic loads have been considered in only small-scale problems. Recently, an algorithm for dynamic response optimization using transformation of dynamic loads into equivalent static loads has been proposed. The transformation is conducted to match the displacement fields from dynamic and static analyses. The algorithm can be applied to large-scale problems. However, the application has been limited to size optimization. The present study applies the algorithm to shape optimization. Because the number of degrees of freedom of finite element models is usually very large in shape optimization, it is difficult to conduct dynamic response optimization with the conventional methods that directly threat dynamic response in the time domain. The optimization process is carried out via interfacing an optimization system and an analysis system for structural dynamics. Various examples are solved to verify the algorithm. The results are compared to the results from static loads. It is found that the algorithm using static loads transformed from dynamic loads based on displacement is valid even for very large-scale problems such as shape optimization.