• 한국항해항만학회지
• /
• 제28권4호
• /
• pp.305-309
• /
• 2004

The problem for parameters estimation of the received signals impinging on array sensors has long been of great research Interest in a great variety of applications, such as radar, sonar, and land mobile communications systems. Conventional subspace-based algorithms, such as MUSIC and ESPRIT, require an extensive computation of inverse matrix and eigen-decomposition In this paper, we propose a new parameters estimation algorithm via nonlinear minimization, which is simplified computationally and estimates signal parameters simultaneously.

• 산업경영시스템학회지
• /
• 제36권3호
• /
• pp.95-108
• /
• 2013

The problem of constrained sequencing of a set of jobs on a conveyor system with the objective of minimizing setup cost is investigated in this paper. A setup cost is associated with extra material, labor, or energy required due to the change of attributes in consecutive jobs at processing stations. A finite set of attributes is considered in this research. Sequencing is constrained by the availability of conveyor junctions. The problem is motivated by the paint purge reduction problem at a major U.S. automotive manufacturer. We first model a diverging junction with a sequence-independent setup cost and predefined attributes as an assignment problem and this model is then extended for a more general situation by relaxing the initial assumptions in various ways.

• 한국산업정보학회논문지
• /
• 제16권5호
• /
• pp.9-19
• /
• 2011

In many instances a concise form of logic is often required for building today's complex systems. The method described in this paper can be used for a wide range of industrial applications that requires Boolean type of logic minimization. Unlike some of the previous logic minimization methods, the proposed method can be used to better gain insights into the logic minimization process. Based on the decimal valued matrix, the method described here can be used to find an exact minimized solution for a given Boolean function. It is a visual based method that primarily relies on grouping the cell values within the matrix. At the same time, the method is systematic to the extent that it can also be computerized. Constructing the matrix to visualize a logic minimization problem should be relatively easy for the most part, particularly if the computer-generated graphs are accompanied.

• 대한기계학회논문집
• /
• 제19권8호
• /
• pp.1799-1809
• /
• 1995

The applicability of the field-consistency paradigm, which was originally employed for analysis of locking due to constrained energy having the second power of a strain, is extended to the constrained energy having a quadratic form of strain. For the extension, nearly-incompressible plane strain problem is considered by introducing the concept of reduced minimization. The field-consistent analysis of the plane strain problem leads to a clear and systematic understanding on the relation amongst constraints imposed on element, spurious constraint -free optimal points, and integration order used.

• 대한수학회지
• /
• 제43권1호
• /
• pp.45-63
• /
• 2006

This paper is concerned with a boundary control problem for the vorticity minimization, in which the flow is governed by the stationary two dimensional Stokes equations. We wish to find a mathematical formulation and a relevant process for an appropriate control along the part of the boundary to minimize the vorticity due to the flow. After showing the existence and uniqueness of an optimal solution, we derive the optimality conditions. The differentiability of the state solution in regard to the control parameter shall be conjunct with the necessary conditions for the optimal solution. For the minimizer, an algorithm based on the conjugate gradient method shall be proposed.

• Korean Journal of Mathematics
• /
• 제23권2호
• /
• pp.293-312
• /
• 2015

We deal with a boundary control problem for the vorticity minimization, in which the ow is governed by the time-dependent two dimensional incompressible Navier-Stokes equations. We derive a mathematical formulation and a process for an appropriate control along the portion of the boundary to minimize the vorticity motion due to the ow in the fluid domain. After showing the existence of an optimal solution, we derive the optimality system for which optimal solutions may be determined. The differentiability of the state solution in regard to the control parameter shall be conjunct with the necessary conditions for the optimal solutions.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권4호
• /
• pp.188-196
• /
• 2001

This paper presents and efficient algorithm for the loss minimization by automatic sectionalizing switch operation in distribution systems. Ant colony algorithm is multi-agent system in which the behaviour of each single agent, called artificial ant, is inspired by the behaviour of real ants. Ant colony algorithm is suitable for combinatiorial optimization problem as network reconfiguration because it use the long term memory, called pheromone, and heuristic information with the property of the problem. The proposed methodology with some adoptions have been applied to improve the computation time and convergence property. Numerical examples demonstrate the validity and effectiveness of the proposed methodology using a KEPCO's distribution system.

• 대한수학회논문집
• /
• 제3권1호
• /
• pp.85-91
• /
• 1988

• 한국경영과학회지
• /
• 제3권1호
• /
• pp.75-79
• /
• 1978

The use of three mathematical programming techniques (quadratic programming, integer quadratic programming and linear programming) is discussed to solve some problems in linear regression analysis. When the criterion is the minimization of the sum of squared deviations and the parameters are linearly constrained, the problem may be formulated as quadratic programming problem. For the selection of variables to find "best" regression equation in statistics, the technique of integer quadratic programming is proposed and found to be a very useful tool. When the criterion of fitting a linear regression is the minimization of the sum of absolute deviations from the regression function, the problem may be reduced to a linear programming problem and can be solved reasonably well.ably well.

• 대한수학회지
• /
• 제38권1호
• /
• pp.1-23
• /
• 2001

This paper is concerned with an optimal shape control problem for the stationary Navier-Stokes system. A two-dimensional channel flow of an incompressible, viscous fluid is examined to determine the shape of a bump on a part of the boundary that minimizes the viscous drag. by introducing an artificial compressibility term to relax the incompressibility constraints, we take the penalty method. The existence of optima solutions for the penalized problem will be shown. Next, by employing Lagrange multipliers method and the material derivatives, we derive the shape gradient for the minimization problem of the shape functional which represents the viscous drag.