• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.111-125
• /
• 2012

In this paper, we introduce new classes of generalized convex n-set functions called $d$-weak strictly pseudo-quasi type-I univex, $d$-strong pseudo-quasi type-I univex and $d$-weak strictly pseudo type-I univex functions and focus our study on multiobjective subset programming problem. Sufficient optimality conditions are obtained under the assumptions of aforesaid functions. Duality results are also established for Mond-Weir and general Mond-Weir type dual problems in which the involved functions satisfy appropriate generalized $d$-type-I univexity conditions.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1999.10a
• /
• pp.419-424
• /
• 1999

In this paper, the comparison of the first order approximation schemes such as SLP (sequential linear programming), CONLIN(convex linearization), MMA(method of moving asymptotes) and the second order approximation scheme, SQP(sequential quadratic programming) was accomplished for optimization of and nonlinear structures. It was found that MMA and SQP(sequential quadratic programming) was accomplished for optimization of and nonlinear structures. It was found that MMA and SQP are the most efficient methods for optimization. But the number of function call of SQP is much more than that of MMA. Therefore, when it is considered with the expense of computation, MMA is more efficient than SQP. In order to examine the efficiency of MMA for complex optimization problem, it was applied to the helicopter tail boom considering column buckling and local wall buckling constraints. It is concluded that MMA can be a very efficient approximation scheme from simple problems to complex problems.

• Journal of the Korean Mathematical Society
• /
• v.50 no.4
• /
• pp.727-753
• /
• 2013

In this paper, we introduce three new broad classes of second-order generalized convex functions, namely, ($\mathcal{F}$, $b$, ${\phi}$, ${\rho}$, ${\theta}$)-sounivex functions, ($\mathcal{F}$, $b$, ${\phi}$, ${\rho}$, ${\theta}$)-pseudosounivex functions, and ($\mathcal{F}$, $b$, ${\phi}$, ${\rho}$, ${\theta}$)-quasisounivex functions; formulate eight general second-order duality models; and prove appropriate duality theorems under various generalized ($\mathcal{F}$, $b$, ${\phi}$, ${\rho}$, ${\theta}$)-sounivexity assumptions for a multiobjective programming problem containing arbitrary norms.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.1
• /
• pp.27-36
• /
• 2000

We perform a computational complexity analysis of a heuristic algotithm proposed in the literature for the combinatorial optimization problems extended with a single side-constraint. This algorithm, although such a view was not given in the original work, is a disguised version of an optimal Lagrangian dual solution technique. It also has been observed to be a very efficient heuristic producing near-optimal solutions for the primal problems in some experiments. Especially, the number of iterations grows sublinearly in terms of the network node size so that the heuristic seems to be particularly suitable for the applicatons such as routing with semi-real time requirements. The goal of this paper is to establish a polynomal worst-case complexity of the algorithm. In particular, the obtained complexity bound suports the sublinear growth of the required iterations.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.2
• /
• pp.69-85
• /
• 2006

Transductive Support Vector Machine(TSVM) is one of semi-supervised learning algorithms which exploit the domain structure of the whole data by considering labeled and unlabeled data together. Although it was proposed several years ago, there has been no efficient algorithm which can handle problems with more than hundreds of training examples. In this paper, we propose an efficient branch-and-bound algorithm which can solve large-scale TSVM problems with thousands of training examples. The proposed algorithm uses two bounding techniques: min-cut bound and reduced SVM bound. The min-cut bound is derived from a capacitated graph whose cuts represent a lower bound to the optimal objective function value of the dual problem. The reduced SVM bound is obtained by constructing the SVM problem with only labeled data. Experimental results show that the accuracy rate of TSVM can be significantly improved by learning from the optimal solution of TSVM, rather than an approximated solution.

• Korean Journal of Child Studies
• /
• v.18 no.2
• /
• pp.5-18
• /
• 1997

The purpose of the current study was to determine whether preschoolers' attachment relationships with their parents and socioemotional behaviors are related to their day care experiences in infancy and at the present time. The participants consisted of 59 preschoolers and their mothers from 2-parent, white, middle-class dual earner families in Madison, Wisconsin. Preschoolers' attachment quality was measured by two representational instruments: the Separation Anxiety Test and "My Family and Friends". Mothers completed questionnaires about their family background and their children's day care history. The quality of current day care was obtained from directors' reports about regulatable features of the day care centers. Teachers completed the Preschool Behavior Questionnaire. Data was analyzed by hierarchical multiple regression analysis. The results showed that the quality of preschoolers' attachment relationships with parents were significantly related to the amount of day care during infancy, the quality of current care, and children's gender. In addition, the amount of infant day care appeared to have negative relations with children's socioemotional behavior problems as evaluated by teachers.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.1
• /
• pp.81-94
• /
• 1998

In order to extract the contour of interesting object in the image, Kass suggested the Active Contour Model called "Snakes". Snakes is a model which defines the contour of image energy. It also can find the contour of object by minimizing these energy functions. The speed of this model is slow and this model is sensitive of initialization. In order to improve these problems, Gunn extracted the accurate contour by using two initialization. and operated to less sensitive of initialization. This method could extract more accurate contour than the existing method, but it had no effect in the speed and it was sensitive of noise. This paper applied to the Energy Minimization Algorithm about only the pixel within the window applying the window of 8$\times$8 size at each contour point consisting Snakes in order to solve these problems. The method offered in this paper is applied to extract the contour of original image and cup image added to gaussian noise. By tracking the face using this offered method, it is applied to virtual reality and motion tracking. tracking.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.8
• /
• pp.174-181
• /
• 2001

Nowadays, the improvement and development of Multi-media and information & communication technology is rapidly processed. They need large data storage capacity. So that, many studies and researches in data storage have been carried out. According to them, the data storage capacity has been increased. But the limitation of storage capacity is happened for several problems. One of them is spot & pit size in optical and magnetic data storage and another is the resolution of actuators. The problems in spot & pit size are covered by new data storage methods-- for examples, AFM(Atomic Force Microscopy), MO(Magneto-optical) system, and NFR(Near-Field decoding) system etc. But the resolution limit of an actuator was not developed and doesn\`t follow up the development of spot & pit size. Because of them, we should improve a resolution of an actuator. Especially, in this paper an actuator if studied and designed for NFR (in using SIL(Solid Immersion Lens) system. It is a dual stage actuator, which consists of a Fine actuator and a Coarse actuator. and should desire 100nm accuracy. Its actuating force generation method is VCM(Voice Coil Motor). The Fine actuator is composed of 4-leaf springs and a bobbin wrapped by coil. The Coarse actuator has Coils and 3-Roller bearings. Also, The Characteristics of designed actuator for NFR system is estimated by Sine-Swept mode and LDV(Laser Doppler Vibro-meter).

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.12 no.1
• /
• pp.59-70
• /
• 1992

Quadratic programming problems(QP) have been widely used as a direction-finding subproblem in the engineering and structural design optimization. To develop an efficient solution algorithm for the QP subproblems, theoretical aspects and numerical behavior of mathematical programming methods that can be used as QP solver are studied and compared. For the solution of both primal and dual QP, Simplex, gradient projection(GRP), and augmented Lagrange multiplier algorithms are investigated and coded. From the numerical study, it is found that the primal GRP algorithm with potential constraint strategy and the dual Simplex algorithm are more attractive and effective than the others. They have theoretical robustness as well. Moreover, primal GRP algorithm is preferable in case the number of constraints is larger than the number of design variables. Favorable features of GRP and Simplex algorithm are merged into a combined algorithm, which is useful in the structural design optimization.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.46 no.1
• /
• pp.68-75
• /
• 2009

In this paper, an efficient proposed CDR(Clock and Data Recovery Circuits) using 1/4-rate clock based on dual-interpolator is proposed. The CDR is aimed to overcome problems that using multi-phase clock to decrease the clock generator frequency causes side effects such as the increased power dissipation and hardware complexity, especially when the number of channels is high. To solve these problems, each recovery part generates needed additional clocks using only inverters, but not flip-flops while maintaining the number of clocks supplied from a clock generator the same as 1/2-rate clock method. Thus, the reduction of a clock generator frequency using 1/4-rate clocking helps relax the speed limitation and power dissipation when higher data rate transfer is demanded.