• 한국컴퓨터정보학회논문지
• /
• 제21권1호
• /
• pp.131-138
• /
• 2016

In this paper, we propose a simple linear bottleneck assignment problems (LBAP) algorithm to find the optimal solution. Generally, the LBAP has been solved by threshold or augmenting path algorithm. The primary characteristic of proposed algorithm is derived the optimal solution of LBAP from linear sum assignment problem (LSAP). Firstly, we obtains the solution for LSAP from the selected minimum cost of rows and moves the duplicated costs in row to unselected row with minimum increasing cost in direct and indirect paths. Then, we obtain the optimal solution of LBAP according to the maximum cost of LSAP can be move to less cost. For the 29 balanced and 7 unbalanced problem, this algorithm finds optimal solution as simple.

• 전자공학회논문지A
• /
• 제31A권12호
• /
• pp.142-151
• /
• 1994

This paper proposes new algorithms to solve canonical piecewise-linear equations with linear partitions and illustrates their efficiency through the analysis of resistive network. The basic idea of the proposed algorithm is to find the best next guess, closest to the actual solution, at each Newton-Raphson (N-R) iteration by comparing the images of nest guess candidates and that of the actual solution. The proposed algorithm can reduce the number of the N-R iterations rquired for convergence greatly, compared to the actual solution, at each Newton-Raphson (N-R) iteration by comparing the images of next guess candidates and that of the actual solution. The proposed algorithm can reduce the number of the N-R iterations required for convergence greatly, compared to the Katzenelson algorithm. When applied to analyzing test circuits, the proposed algorithm required 8 to 20 times fewer N-R iterations and 5 to 10 times less CPU time than the Katzenelson algorithm, depending on the size of the circuits. The experimental results also exhibit that the efficiency of the proposed algorithm over the Katzenelson algorithm increases as the number of the piecewise-linear regions for the representation of the circuit.

• 한국통신학회논문지
• /
• 제41권6호
• /
• pp.672-677
• /
• 2016

인터넷의 발전은 네트워크 기술과 응용의 확장적 배치와 더불어 성공적으로 고무되어 왔다. 하지만, 요즘에는 인터넷의 사용은 심각한 트래픽 과부하를 야기 시킨다. 따라서, 우리는 효율적인 자원 할당을 위해 네트워크 가상화의 지속적인 연구와 발전이 필요하다. 본 논문은 Piecewise Linear 비용함수를 이용한 비용 최소화 가상 네트워크 매핑 알고리즘을 제안 한다. 노드 매핑에는 선형 프로그래밍을 이용한 알고리즘과 D-VINE을 이용하였고, 링크 매핑에는 선형 프로그래밍 솔루션을 기반으로 최단 경로 알고리즘을 이용하였다. 이와 같은 방법으로 네트워크상에서 Linear와 Tree 구조로 형성된 VN request의 도착률에 따른 평균 비용을 ViNEYard와 비교 분석하였다. 시뮬레이션 구현을 통해 우리의 알고리즘이 ViNEYard 을 사용할 때 보다 발생하는 평균 비용이 낮음을 확인할 수 있었다.

• Structural Engineering and Mechanics
• /
• 제65권6호
• /
• pp.721-730
• /
• 2018

This paper aims to inspect the effectiveness of the Simple Adaptive Control Method (SACM) to control the response of asymmetric buildings with rotationally non-linear behavior under seismic loads. SACM is a direct control method and was previously used to improve the performance of linear and non-linear structures. In most of these studies, the modeled structures were two-dimensional shear buildings. In reality, the building plans might be asymmetric, which cause the buildings to experience torsional motions under earthquake excitation. In this study, SACM is used to improve the performance of asymmetric buildings, and unlike conventional linear models, the non-linear inertial coupling terms are considered in the equations of motion. SACM performance is compared with the Linear Quadratic Regulator (LQR) algorithm. Moreover, the LQR algorithm is modified, so that it is appropriate for rotationally non-linear buildings. Active tuned mass dampers are used to improve the performance of the modeled buildings. The results show that SACM is successful in reducing the response of asymmetric buildings with rotationally non-linear behavior under earthquake excitation. Furthermore, the results of the SACM were very close to those of the LQR algorithm.

• 제어로봇시스템학회논문지
• /
• 제11권9호
• /
• pp.755-760
• /
• 2005

This paper proposes an improved implementation algorithm for the continuous-time receding horizon control (RHC). The proposed algorithm has a feature that it has better control performance than the existing algorithm. Main idea of the proposed algorithm is that we can approximate the original RHC problem better by assuming the predicted input trajectory on the prediction horizon has a continuous form, which is constructed from linear interpolation of finite number of vectors. This, in turn, leads to improved control performance. We derive a predictor such that it takes linear interpolation into account and proposes the method by which we can express the cost exactly. Through simulation study fur an inverted pendulum, we illustrate that the proposed algorithm has the better control performance than the existing one.

• Communications for Statistical Applications and Methods
• /
• 제14권1호
• /
• pp.205-213
• /
• 2007

In this paper, the normal mixture model subjected to general linear restriction for component-means based on linear regression is proposed, and its fitting method by EM algorithm and Lagrange multiplier is provided. This model is applied to gene clustering of microarray expression data, which demonstrates it has very good performances for real data set. This model also allows to obtain the clusters that an analyst wants to find out in the fashion that the hypothesis for component-means is represented by the design matrices and the linear restriction matrices.

• 정보보호학회논문지
• /
• 제17권6호
• /
• pp.11-18
• /
• 2007

다중선형공격은 선형공격을 강화하기 위한 방법으로 연구되어왔다. 본 논문에서는 다중선형공격에 관한 최신 이론인 Biryukov의 공격 알고리즘이 비선형 키스케줄을 가진 블록암호에 적용이 어려움을 지적하고, 새로운 다중선형공격법을 제안한다. 작은 블록암호에 대한 실험을 통하여 새로운 다중선형공격법에 관한 이론이 실제로도 매우 잘 적용될 수 있음이 보여진다.

• Journal of applied mathematics & informatics
• /
• 제29권5_6호
• /
• pp.1285-1293
• /
• 2011

We establishes the polynomial convergence of a new class of path-following methods for semidefinite linear complementarity problems (SDLCP) whose search directions belong to the class of directions introduced by Monteiro [9]. Namely, we show that the polynomial iteration-complexity bound of the well known algorithms for linear programming, namely the predictor-corrector algorithm of Mizuno and Ye, carry over to the context of SDLCP.

• 대한수학회보
• /
• 제38권2호
• /
• pp.293-302
• /
• 2001

We improve the greedy algorithm which is one of the general convergence criterion for certain iterative sequence in a given space by building a constructive greedy algorithm on a normed linear space using an arithmetic average of elements. We also show the degree of approximation order is still $Ο(1\sqrt{\n}$) by a bounded linear functional defined on a bounded subset of a normed linear space which offers a good approximation method for neural networks.

• 전력전자학회:학술대회논문집
• /
• 전력전자학회 1999년도 전력전자학술대회 논문집
• /
• pp.139-142
• /
• 1999

Recently, the application of the linear machine for industrial field is remarkable increased, especially for the gantry machine and machine tool system. In these application, high precise position control performance is essentially required in steady/transient state. This paper presents the generalized PID position control algorithm which have rare sensitivity to mass and disturbance. Through the experimental results, it is shown that the proposed algorithm have good performance for the linear machine drives in the steady state and transient state in spite of the load mass varing.