• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2010.11a
• /
• pp.519-520
• /
• 2010

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.161-164
• /
• 2005

Data mining techniques can be applied to identify patterns of interest in the gene expression data. One goal in mining gene expression data is to determine how the expression of any particular gene might affect the expression of other genes. To find relationships between different genes, association rules have been applied to gene expression data set [1]. A notable limitation of association rule mining method is that only the association in a single profile experiment can be detected. It cannot be used to find rules across different condition profiles or different time point profile experiments. However, with the appearance of time-series microarray data, it became possible to analyze the temporal relationship between genes. In this paper, we analyze the time-series microarray gene expression data to extract the sequential patterns which are similar to the association rules between genes among different time points in the yeast cell cycle. The sequential patterns found in our work can catch the associations between different genes which express or repress at diverse time points. We have applied sequential pattern mining method to time-series microarray gene expression data and discovered a number of sequential patterns from two groups of genes (test, control) and more sequential patterns have been discovered from test group (same CO term group) than from the control group (different GO term group). This result can be a support for the potential of sequential patterns which is capable of catching the biologically meaningful association between genes.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.6
• /
• pp.1041-1049
• /
• 2003

In this paper, a new local two-point approximation method which is based on the exponential intervening variable is proposed. This new algorithm, called the Two-Point Convex Approximation(TPCA), use the function and design sensitivity information from the current and previous design points of the sequential approximate optimization to generate a sequence of convex, separable subproblems. This paper describes the derivation of the parameters associated with the approximation and the numerical solution procedure. In order to show the numerical performance of the proposed method, a sequential approximate optimizer is developed and applied to solve several typical design problems. These optimization results are compared with those of other optimizers. Numerical results obtained from the test examples demonstrate the effectiveness of the proposed method.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.383-388
• /
• 2005

Depth recovery in robot vision is an essential problem to infer the three dimensional geometry of scenes from a sequence of the two dimensional images. In the past, many studies have been proposed for the depth estimation such as stereopsis, motion parallax and blurring phenomena. Among cues for depth estimation, depth from lens translation is based on shape from motion by using feature points. This approach is derived from the correspondence of feature points detected in images and performs the depth estimation that uses information on the motion of feature points. The approaches using motion vectors suffer from the occlusion or missing part problem, and the image blur is ignored in the feature point detection. This paper presents a novel approach to the defocus technique based depth from lens translation using sequential SVD factorization. Solving such the problems requires modeling of mutual relationship between the light and optics until reaching the image plane. For this mutuality, we first discuss the optical properties of a camera system, because the image blur varies according to camera parameter settings. The camera system accounts for the camera model integrating a thin lens based camera model to explain the light and optical properties and a perspective projection camera model to explain the depth from lens translation. Then, depth from lens translation is proposed to use the feature points detected in edges of the image blur. The feature points contain the depth information derived from an amount of blur of width. The shape and motion can be estimated from the motion of feature points. This method uses the sequential SVD factorization to represent the orthogonal matrices that are singular value decomposition. Some experiments have been performed with a sequence of real and synthetic images comparing the presented method with the depth from lens translation. Experimental results have demonstrated the validity and shown the applicability of the proposed method to the depth estimation.

• Journal of applied mathematics & informatics
• /
• v.6 no.1
• /
• pp.279-289
• /
• 1999

Given n points in the plane the planar convex hull prob-lem in that of finding which of these points belong to the perimeter of the smallest convex region (a polygon) containing all n points. Here we suggest two kinds of methods. First we present a new sequential method for constructing the pla-nar convex hull O(1.5n) time in the quadratic decision tree model. Second using the sequential method we suggest a new parallel algo-rithm which solve the planar convex hull O(1.5n/p) time on a maspar Machine (CREW-PRAM) with O(n) processors. Also when we run on a maspar Machine we achieved a 37. 156-fold speedup with 64 pro-cessor.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.1 s.256
• /
• pp.55-61
• /
• 2007

Recently simulation model becomes an essential tool for analysis and design of a system but it is often expensive and time consuming as it becomes complicate to achieve reliable results. Therefore, high-fidelity simulation model needs to be replaced by an approximate model, the so-called metamodel. Metamodeling techniques include 3 components of sampling, metamodel and validation. Cross-validation approach has been proposed to provide sequnatially new sample point based on cross-validation error but it is very expensive because cross-validation must be evaluated at each stage. To enhance the cross-validation of metamodel, sequential sampling method using candidate points and representative cross-validation is proposed in this paper. The candidate and representative cross-validation approach of sequential sampling is illustrated for two-dimensional domain. To verify the performance of the suggested sampling technique, we compare the accuracy of the metamodels for various mathematical functions with that obtained by conventional sequential sampling strategies such as maximum distance, mean squared error, and maximum entropy sequential samplings. Through this research we team that the proposed approach is computationally inexpensive and provides good prediction performance.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.12
• /
• pp.3040-3052
• /
• 2000

For effective construction of second-order response surface models, an efficient quad ratic approximation method is proposed in the context of trust region model management strategy. In the proposed method, although only the linear and quadratic terms are uniquely determined using 2n+1 design points, the two-factor interaction terms are mathematically updated by normalized quasi-Newton formula. In order to show the numerical performance of the proposed approximation method, a sequential approximate optimizer is developed and solves a typical unconstrained optimization problem having 2, 6, 10, 15, 30 and 50 design variables, a gear reducer system design problem and two dynamic response optimization problems with multiple objectives, five objectives for one and two objectives for the other. Finally, their optimization results are compared with those of the CCD or the 50% over-determined D-optimal design combined with the same trust region sequential approximate optimizer. These comparisons show that the proposed method gives more efficient than others.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.3
• /
• pp.259-266
• /
• 2011

We present a new dual sequential approximate optimization (SAO) algorithm called SD-TDQAO (sequential dual two-point diagonal quadratic approximate optimization). This algorithm solves engineering optimization problems with a nonlinear objective and nonlinear inequality constraints. The two-point diagonal quadratic approximation (TDQA) was originally non-convex and inseparable quadratic approximation in the primal design variable space. To use the dual method, SD-TDQAO uses diagonal quadratic explicit separable approximation; this can easily ensure convexity and separability. An important feature is that the second-derivative terms of the quadratic approximation are approximated by TDQA, which uses only information on the function and the derivative values at two consecutive iteration points. The algorithm will be illustrated using mathematical and topological test problems, and its performance will be compared with that of the MMA algorithm.

• Journal of Korean Society for Quality Management
• /
• v.48 no.2
• /
• pp.269-282
• /
• 2020

Purpose: The practical design for experiments with mixtures of q components is consisted in the four types of design points, vertex, center of edge, axial, and center points in a (q-1)-dimensional simplex space. We propose a sequential method for the successful construction of the design space in Quality by Design (QbD) by allowing the different number of replicates at the four types of design points in the practical design when the quadratic canonical polynomial model is assumed. Methods: To compare the mixture designs efficiency, fraction of design space (FDS) plot is used. We search for the practical mixture designs whose the minimal half-width of the tolerance interval per a standard deviation, which is denoted as d₂, is less than 4.5 at 0.8 fraction of the design space. They are found by adding the different number of replicates at the four types of the design points in the practical design. Results: The practical efficient mixture designs for the number of components between three and five are listed. The sequential method to establish a design space is illustrated with the two examples based on the simulated data. Conclusion: The designs with the center of edge points replications are more efficient than those with the vertex points replication. We propose the sample size of at least 23 for three components, 28 for four components, and 33 for the five components based on the list of efficient mixture designs.

• Journal of Mechanical Science and Technology
• /
• v.15 no.7
• /
• pp.876-888
• /
• 2001

For a large scaled optimization based on response surface methods, an efficient quadratic approximation method is presented in the context of the trust region model management strategy. If the number of design variables is η, the proposed method requires only 2η+1 design points for one approximation, which are a center point and tow additional axial points within a systematically adjusted trust region. These design points are used to uniquely determine the main effect terms such as the linear and quadratic regression coefficients. A quasi-Newton formula then uses these linear and quadratic coefficients to progressively update the two-factor interaction effect terms as the sequential approximate optimization progresses. In order to show the numerical performance of the proposed method, a typical unconstrained optimization problem and two dynamic response optimization problems with multiple objective are solved. Finally, their optimization results compared with those of the central composite designs (CCD) or the over-determined D-optimality criterion show that the proposed method gives more efficient results than others.