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

We present a method to detect on-road vehicle using geometric invariant of feature points on side planes of the vehicle. The vehicles are assumed into a set of planes and the invariant from motion information of features on the plane segments the plane from the theory that a geometric invariant value defined by five points on a plane is preserved under a projective transform. Harris corners as a salient image point are used to give motion information with the normalized correlation centered at these points. We define a probabilistic criterion to test the similarity of invariant values between sequential frames. Experimental results using images of real road scenes are presented.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.6
• /
• pp.340-346
• /
• 2003

This paper presents a game theory application for an analysis of uniform price auction in a simplified competitive electricity market and analyzes the properties of Nash equilibrium for various conditions. We have assumed that each generation firm submits his bid to a market in the form of a sealed bid and the market is operated as a uniform price auction. Two firms are supposed to be the players of the market, and we consider the maximum generation quantity constraint of one firm only. The system demand is assumed to have a linear relationship with market clearing prices and the bidding curve of each firm, representing the price at which he has a willingness to sell his generation quantity, is also assumed to have a linear function. In this paper, we analyze the effects of maximum generation quantity constraints on the Nash equilibrium of the uniform price auction. A simple numerical example with two generation firms is demonstrated to show the basic idea of the proposed methodology.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.1 s.173
• /
• pp.215-224
• /
• 2000

In order to reduce the variation effects of uncertainties in the engineering environments, new robust optimization method, which considers the uncertainties in design process, is proposed. Both design variables and system parameters are considered as random variables about their nominal values. To ensure the robustness of performance function, a new objective is set to minimize the variance of that function. Constraint variations are handled by introducing probability constraints. Probability constraints are solved by the advanced first order second moment (AFOSM) method based on the reliability theory. The proposed robust optimization method has an advantage that the second derivatives of the constraints are not required. The suggested method is examined by solving three examples and the results are compared with those for deterministic case and those available in literature.

• Communications of the Korean Mathematical Society
• /
• v.25 no.1
• /
• pp.139-147
• /
• 2010

A generalized nondifferentiable fractional optimization problem (GFP), which consists of a maximum objective function defined by finite fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions, is considered. Recently, Kim et al. [Journal of Optimization Theory and Applications 129 (2006), no. 1, 131-146] proved optimality theorems and duality theorems for a nondifferentiable multiobjective fractional programming problem (MFP), which consists of a vector-valued function whose components are fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions. In fact if $\overline{x}$ is a solution of (GFP), then $\overline{x}$ is a weakly efficient solution of (MFP), but the converse may not be true. So, it seems to be not trivial that we apply the approach of Kim et al. to (GFP). However, modifying their approach, we obtain optimality conditions and duality results for (GFP).

• Journal of the Korea Safety Management & Science
• /
• v.4 no.1
• /
• pp.131-139
• /
• 2002

Since introducing the "Theory of Constraints" by Goldratt, its effect was verified by lots of scholars, men of enterprise. These days it is also introducing and studying in this country with good results. The objective of this study is to show how to determine the constraint resources on DBR scheduling. Actually, previous studies based on the line which just think a load/capacity rate on doing scheduling. This study will show a scheduling method which reflects multi-parameters. It could be a standard to reflect real manufacturing surroundings. On calculating a priority of each resources, we classified factors with subjective and objective factors. And we propose a decision model to incorporate values assigned by a group of experts on different factors to select a critical resource. On deploying this model, SN ratio of Taguchi method for each of subjective and objective factors will be used. And we propose a procedure which is organized with 7 steps. To understand the logic, a numerical manufacturing simulation will be presented. This method is a incorporating decision model on determining the constraint on multi parameters with experts.h experts.

• Language and Information
• /
• v.18 no.2
• /
• pp.1-29
• /
• 2014

Relativization is one of the common syntactic operations to merge two different clauses into a single information unit. This operation plays a pivotal role to structuralize multiple clauses cohesively as well as serves to specify the property an individual has within the context. That implies that relativization contributes to information structure of multiclausal sentences. In this context, this paper delves into information structure of relative clauses in English with an eye toward creation of a computational model from a standpoint of machine translation. The current work employs Head-driven Phrase Structure Grammar (HPSG, Pollard and Sag (1994)) as a theory of grammar and Minimal Recursion Semantics (MRS, Copestake et al. (2005) as a meaning representation system. Building upon these formalisms, this paper addresses how information structure of relative clauses can be represented and constrained. The current work makes use of Individual CONStraints (ICONS) for modeling relative clauses with respect to information structure. The current work also investigates which relative clause involves which information structure constraint. The present study argues that non-restrictive relative clauses impose a more specific constraint on information structure than restrictive relative clauses.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2004.11a
• /
• pp.40-44
• /
• 2004

A fact that limits a company's ability to achieve more of its goal is referred to as a 'constraint' shipbuilding industries need to identify and manage constraints. The theory of constraints is evolved out of the problems of bottleneck formation. This happens and is conserved for the formulation if various real time problems for arriving standard uniquely addressed problems If, for example, the goal of a shipbuilding industry is to make money now and in the future, it is suggested that TOC will enable th mangers of the company to do so. TOC, focuses the organization scare resources on improving the performance of the true constraints, and therefore the bottom line of the organization. An attempt is made for the implantation of the theory into real world shipyard decision support mechanism.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.533-539
• /
• 1993

In this paper, two side-attack guidance laws for an underwater vehicle are considered. In order to find the guidance command, we first make use of the optimal guidance law with terminal impact angle constraint. Secondly, the optimal solution of tracking problem is used. This paper shows some brief theory which is used in deriving the side-attack guidance laws, and the method of computing these guidance laws. Simulations on underwater vehicle for a constant moving target prove that the suggested side-attack guidance laws have enhanced side attack performance over the optimal guidance law with miss distance weighting only. Furthermore, from simulation results. we conclude that the guidance law using the optimal solution of tracking problem is more efficient for the side-attack guidance than the optimal guidance law with terminal impact angle constraint.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.2
• /
• pp.125-129
• /
• 2004

There are several kinds of fuzzy set extensions in the fuzzy set theory. Among them, this paper is concerned with interval-valued fuzzy sets, intuitionistic fuzzy sets, and bipolar-valued fuzzy sets. In interval-valued fuzzy sets, membership degrees are represented by an interval value that reflects the uncertainty in assigning membership degrees. In intuitionistic fuzzy sets, membership degrees are described with a pair of a membership degree and a nonmembership degree. In bipolar-valued fuzzy sets, membership degrees are specified by the satisfaction degrees to a constraint and its counter-constraint. This paper investigates the similarities and differences among these fuzzy set representations.

• Proceedings of the KSME Conference
• /
• 2000.04a
• /
• pp.725-730
• /
• 2000

Genetic algorithms based on the theory of natural selection, have been applied to many different fields, and have proven to be relatively robust means to search for global optimum and handle discontinuous or even discrete data. Genetic algorithms are widely used for unconstrained optimization problems. However, their application to constrained optimization problems remains unsettled. The most prevalent technique for coping with infeasible solutions is to penalize a population member for constraint violation. But, the weighting of a penalty for a particular problem constraint is usually determined in the heuristic way. Therefore this paper proposes, the effective technique for handling constraints, the ranking penalty method and hybrid genetic algorithms. And this paper proposes dynamic mutation tate to maintain the diversity in population. The effectiveness of the proposed algorithm is tested on several test problems and results are discussed.