• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.107-110
• /
• 1997

본 논문에서는 선형 이진 신경회로망 (Linear Binary Neural Network)을 최소화 하기 위하여, 입력패턴의 그룹화 가능성을 측정하는 조건함수를 제시한다. 또한 이 조건식으로 그룹화 우선순위를 정하고 iteration을 통해 신경회로망을 합성하는 MSP Term Grouping Algorithm을 보인다. 여려가지 예제에 대한 실제적 합성 실험을 통해 기존의 알고리즘과 제시된 알고리즘을 비교한 결과는 제시된 알고리즘이 기존의 알고리즘 보다 작은 크기의 선형 이진 신경회로망을 합성할 수 있는 향상된 방법임을 보여준다.

• Proceedings of the KIEE Conference
• /
• 1989.11a
• /
• pp.176-179
• /
• 1989

Newton's OPF algorithm, for each iteration, solves with second order approximation of Lagraqngian function and sparse matrix technique. When load model is applied to this technique, load voltages have tendency to be fixed at lower limit. It makes the solution inadequte. In this paper, reference bus voltage specification technique suggested to make adequate load voltage. This method is verified useful 6-bus Ward-Hale sample system.

• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.735-746
• /
• 1999

Based on an active set strategy a method for solving lin-early constrained indefinite quadratic programs to solve the correspond-ing system of equations at each iteration is presented. The algorithm takes two descent directions to strictly decrease the value of objective function and obtains a suitable step to maintain feasibility. Computa-tional results on a range of quadratic test problems are given.

• Journal of Advanced Marine Engineering and Technology
• /
• v.31 no.6
• /
• pp.681-686
• /
• 2007

The flow analysis was made by applying the turbulent models in the scroll volume of centrifugal compressor. The $k-{\varepsilon}.\;k-{\omega}$, Spalart-Allmaras and reynolds stress models are used in which the hybrid grid is applied for the simulation. The velocity vector the Pressure contour. the change of residual along the iteration number. and the dynamic head are simulated by solving the Navier-Stokes equations for the comparison of four example cases.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2002.11a
• /
• pp.335.1-335
• /
• 2002

Among many structural dynamics modification methods for plate and shell vibration problems, embedding an emboss to the surface is very efficient. But deciding an optimal position and shape using optimization algorithm needs defining geometry and remeshing the model for every iteration step to implement the method, which takes much numerical cost. (omitted)

• Nuclear Engineering and Technology
• /
• v.44 no.2
• /
• pp.207-224
• /
• 2012

This article discusses selects of some outstanding problems in nuclear reactor analysis, with proposed approaches thereto and numerical test results, as follows: i) multi-group approximation in the transport equation, ii) homogenization based on isolated single-assembly calculation, and iii) critical spectrum in Monte Carlo depletion.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.1045-1058
• /
• 2000

In usual synchronous parallel computing, workload balance is a crucial factor to reduce idle times of some processors that have finished their jobs earlier than others. However, it is difficult to achieve on a heterogeneous workstation clusters where the available computing power of each processor is unpredictable. As a way to overcome such a problem, the idea of asynchronous methods has grown out and is being increasingly used and studied, but there is none for eigenvalue problems yet. In this paper, we suggest a new asynchronous method to solve some singular matrix problems, that can also be used for finding a certain eigenvector of some matrices.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.3
• /
• pp.59-65
• /
• 1992

A modified primal-dual affine scaling algorithm for linear programming is presented. This modified algorithm generates an elipsoid containing all optimal dual solutions at each iteration, then checks whether or not a dual hyperplane intersects this ellipsoid. If the dual hyperplane has no intersection with this ellipsoid, its corresponding column must be optimal nonbasic. By condensing these columns, the size of LP problem can be reduced.

• Journal of the Korean Mathematical Society
• /
• v.49 no.1
• /
• pp.187-200
• /
• 2012

In this paper, we introduced a new extended extragradient iteration algorithm for finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of equilibrium problems for a monotone and Lipschitz-type continuous mapping. And we show that the iterative sequences generated by this algorithm converge strongly to the common element in a real Hilbert space.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.823-835
• /
• 2010

In this paper, A FSQP algorithm for degenerate inequality constraints optimization problems is proposed. At each iteration of the proposed algorithm, a feasible direction of descent is obtained by solving a quadratic programming subproblem. To overcome the Maratos effect, a higher-order correction direction is obtained by solving another quadratic programming subproblem. The algorithm is proved to be globally convergent and superlinearly convergent under some mild conditions. Finally, some preliminary numerical results are reported.