• International Journal of Advanced Culture Technology
• /
• v.5 no.4
• /
• pp.44-50
• /
• 2017

The topic of selection of a grammatical subject in a correlative conjunction phrase has long failed to attract the attention of linguists due to some difficulties not only in figuring out the internal structure of NP's conjoined by a correlative conjunction but also in its heavy dependency on the representational aspects each correlative conjunction demonstrates. In this paper, I have explored the seemingly complex patterns in the selection of a grammatical subject in a correlative conjunction phrase in the frame of the Optimality Theory (Prince & Smolensky 1993, 2008). I show that, with the help of three newly developed constraints such as MinDist, Focus, and PARSE which are ranked relatively to each other, an optimal grammatical subject out of two NP candidates conjoined by a correlative conjunction can be correctly selectable.

• Journal of applied mathematics & informatics
• /
• v.32 no.3_4
• /
• pp.359-375
• /
• 2014

In this paper, a multiobjective nondifferentiable fractional programming problem (MFP) is considered where the objective function contains a term involving the support function of a compact convex set. A vector valued (generalized) ${\alpha}$-univex function is defined to extend the concept of a real valued (generalized) ${\alpha}$-univex function. Using these functions, sufficient optimality criteria are obtained for a feasible solution of (MFP) to be an efficient or weakly efficient solution of (MFP). Duality results are obtained for a Mond-Weir type dual under (generalized) ${\alpha}$-univexity assumptions.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.399-402
• /
• 1993

In this paper, an inverse kinematics of redundant manipulators is proposed. Optimality-constraint based inverse kinematic algorithms have some problems because those algorithms are based on necessary conditions for optimality. Among the problems, switching from a maximum value to a minimum value may occur and make an inverse kinematic solution unstable while performing a given task. An inverse kinematic solution for protecting from the switchings is suggested. By sufficient conditions for optimality, the configuration space is defined as a set of regions, potentially good configuration region and potentially bad configuration region. Inverse kinematics solution within potentially good configuration region can provide joint trajectories without both singularities and switchings. Through a simulation of tracing a circle, we show the effectiveness of this inverse kinematics.

• Language and Information
• /
• v.6 no.2
• /
• pp.129-152
• /
• 2002

This paper argues for a need to adopt a conceptually radical approach to zero anaphora resolution in Korean. It is shown that a number of apparently conflicting constraints, mostly motivated by lexical, syntactic, semantic, and pragmatic factors, are involved in determining the referential identity of zero pronouns in Korean. It is also argued that some of the major concepts of Optimality Theory can provide a good theoretical framework to predict the antecedents to zero pronouns in general. A partial formalization of 07-based constraints at the morpho-syntactic and lexico-semantical level is provided. It is argued that the lexico-semantic restrictions on adjacent expressions play the most important role in the anaphora resolution process along with a variant of the binding principle, formulated in semantic terms. Other pragmatically motivated constraints that incorporate some important intuitions of Centering Theory are proposed too.

• Journal of Mechanical Science and Technology
• /
• v.16 no.2
• /
• pp.203-210
• /
• 2002

For effective response surface modeling during sequential approximate optimization (SAO), the normalized and the augmented D-optimality criteria are presented. The normalized D-optimality criterion uses the normalized Fisher information matrix by its diagonal terms in order to obtain a balance among the linear-order and higher-order terms. Then, it is augmented to directly include other experimental designs or the pre-sampled designs. This augmentation enables the trust region managed sequential approximate optimization to directly use the pre-sampled designs in the overlapped trust regions in constructing the new response surface models. In order to show the effectiveness of the normalized and the augmented D-optimality criteria, following two comparisons are performed. First, the information surface of the normalized D-optimal design is compared with those of the original D-optimal design. Second, a trust-region managed sequential approximate optimizer having three D-optimal designs is developed and three design problems are solved. These comparisons show that the normalized D-optimal design gives more rotatable designs than the original D-optimal design, and the augmented D-optimal design can reduce the number of analyses by 30% - 40% than the original D-optimal design.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.1
• /
• pp.15-22
• /
• 2004

Some recent advances in stability and optimality for the nonlinear receding horizon control (NRHC) or the nonlinear model predictive control (NMPC) are assessed. The NRHCs with terminal conditions are surveyed in terms of a terminal state equality constraint, a terminal cost, and a terminal constraint set. Other NRHCs without terminal conditions are surveyed in terms of a control Lyapunov function (CLF) and cost monotonicity. Additional approaches such as output feedback, fuzzy, and neural network are introduced. This paper excludes the results for linear receding horizon controls and concentrates only on the analytical results of NRHCs, not including applications of NRHCs. Stability and optimality are focused on rather than robustness.

• Korean Journal of Mathematics
• /
• v.6 no.1
• /
• pp.27-46
• /
• 1998

We are concerned with an optimal control problem governed by a Poisson equation in which body force acts like a control parameter. The cost functional to be optimized is taken to represent the error from the desired observation and the cost due to the control. We recast the problem into the mixed formulation to take advantage of the minimax principle for the duality method. The existence of a saddle point for the Lagrangian shall be shown and the optimality system will be derived therein. Finally, to attain an optimal control, we combine the optimality system with an operational technique. By achieving the gradient of the cost functional, a convergent algorithm based on the projected gradient method is established.

• Speech Sciences
• /
• v.10 no.3
• /
• pp.89-101
• /
• 2003

This paper investigates edge effects on the relationship between the underlying tonal sequence and its surface realization in the IP-final Accentual Phrase within the Optimality Theoretic framework. I will examine the way in which AP tones are aligned with their associated syllables in IP-final position. In Korean. Jun's (1996) 'see-saw effect' does not allow any two identical tones if they are marking a boundary of a prosodic group. A phonetic experiment conducted in this paper suggests that the 'see-saw effect' only apply to H boundary tones. Furthermore, it will be shown that the timing of tonal peaks is determined through the ranking of a set of violable constraints. The AP tonal realization is achieved through the access to the global intonation in a complicated way. In the course of discussion, pitch patterns in IP-medial Accentual Phrase will also be discussed.

• Journal of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.971-985
• /
• 2007

A sequential optimality condition characterizing the efficient solution without any constraint qualification for an abstract convex vector optimization problem is given in sequential forms using subdifferentials and ${\epsilon}$-subdifferentials. Another sequential condition involving only the subdifferentials, but at nearby points to the efficient solution for constraints, is also derived. Moreover, we present a proposition with a sufficient condition for an efficient solution to be properly efficient, which are a generalization of the well-known Isermann result for a linear vector optimization problem. An example is given to illustrate the significance of our main results. Also, we give an example showing that the proper efficiency may not imply certain closeness assumption.

• Journal of applied mathematics & informatics
• /
• v.26 no.1_2
• /
• pp.75-106
• /
• 2008

In this paper, we derive necessary optimality conditions for a continuous programming problem in which both objective and constraint functions contain support functions and is, therefore, nondifferentiable. It is shown that under generalized invexity of functionals, Karush-Kuhn-Tucker type optimality conditions for the continuous programming problem are also sufficient. Using these optimality conditions, we construct dual problems of both Wolfe and Mond-Weir types and validate appropriate duality theorems under invexity and generalized invexity. A mixed type dual is also proposed and duality results are validated under generalized invexity. A special case which often occurs in mathematical programming is that in which the support function is the square root of a positive semidefinite quadratic form. Further, it is also pointed out that our results can be considered as dynamic generalizations of those of (static) nonlinear programming with support functions recently incorporated in the literature.