• 대한전기학회논문지
• /
• 제41권9호
• /
• pp.984-993
• /
• 1992

Fuzzy L.P. with Multi-criteria function is adopted in this VAR planning algorithm to accomplish the optimization of comflicting objectives, such as the amount of the VAR installed and power system loss, while keeping the bus voltage profile within an admissible range. Fuzzy L.P. with Multi-criteria function, a powerful tool dealing with the fuzziness of satisfaction levels of the constraints and the goal of objective functions, enables us to search for the solutions which may contribute in VAR planning. This advantage is not provided by traditional standardized L.P. The effectiveness of the proposed algorithm has been verified by the test on the IEEE-30 bus system.

• 한국안전학회지
• /
• 제30권3호
• /
• pp.100-106
• /
• 2015

A module or independent subtree is a part of a fault tree whose child gates or basic events are not repeated in the remaining part of the fault tree. Modules are necessarily employed in order to reduce the computational costs of fault tree quantification. This quantification generates fault tree solutions such as minimal cut sets, minimal path sets, or binary decision diagrams (BDDs), and then, calculates top event probability and importance measures. This paper presents a new linear time algorithm to detect modules of large fault trees. It is shown through benchmark tests that the new method proposed in this study can very quickly detect the modules of a huge fault tree. It is recommended that this method be implemented into fault tree solvers for efficient probabilistic safety assessment (PSA) of nuclear power plants.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1992년도 하계학술대회 논문집 A
• /
• pp.211-213
• /
• 1992

Fuzzy L. P. with Multi-criteria function is adopted in this VAR allocation algorithm to accomplish the optimization of co-conflicting objectives, such as the amount of the VAR Installed and power system loss, while keeping the bus voltage profile within an admissible range. fuzzy L. P., a powerful tool dealing with the fuzziness of satisfaction levels of the constraints and the goal of objective functions, enables us to search for the solutions which may contribute in VAR planning. This advantage Is not provided by traditional standardized L. P. The effectiveness of the proposed algorithm has been verified by the test on the IEEE-30 bus system.

• 한국통신학회논문지
• /
• 제30권5C호
• /
• pp.364-370
• /
• 2005

얼굴 인식에서는 입력 영상에서 얼굴을 검출한 후에 데이터베이스의 영상과 위치와 크기를 일치시키는 등록 과정이 필요하다. 본 논문에서는 영상의 등록 과정에서 발생하는 얼굴영상의 이동, 회전, 혹은 크기의 차이를 eigenspace에서 보정하는 알고리즘을 제안하였다. 이를 위하여 얼굴 영상의 수직, 수평 이동, 회전, 크기 변환 등의 등록오차를 선형보간 행렬로 근사하였다. 각 변환행렬을 사용하여 등록오차에 따른 미분계수를 eigenspace에서 구하면 subpixel 단위의 등록 오차를 보정할 수 있다. 제안된 방법은 공간 영역에서 오차를 보정하는 것보다 계산량이 훨씬 더 적다. 오차 보정 후 얼굴 인식률이 크게 향상되는 것을 실험으로 확인하였다.

• 대한산업공학회지
• /
• 제18권2호
• /
• pp.43-49
• /
• 1992

Edge coloring problem is to find a minimum cardinality coloring of the edges of a graph so that any pair of edges incident to a common node do not have the same colors. Edge coloring problem is NP-hard, hence it is unlikely that there exists a polynomial time algorithm. We formulate the problem as a covering of the edges by matchings and find valid inequalities for the convex hull of feasible solutions. We show that adding the valid inequalities to the linear programming relaxation is enough to determine the minimum coloring number(chromatic index). We also propose a method to use the valid inequalities as cutting planes and do the branch and bound search implicitly. An example is given to show how the method works.

• Journal of Electrical Engineering and Technology
• /
• 제7권4호
• /
• pp.636-645
• /
• 2012

This study introduces an information granular-based fuzzy radial basis function neural networks (FRBFNN) based on multiobjective optimization and weighted least square (WLS). An improved multiobjective space search algorithm (IMSSA) is proposed to optimize the FRBFNN. In the design of FRBFNN, the premise part of the rules is constructed with the aid of Fuzzy C-Means (FCM) clustering while the consequent part of the fuzzy rules is developed by using four types of polynomials, namely constant, linear, quadratic, and modified quadratic. Information granulation realized with C-Means clustering helps determine the initial values of the apex parameters of the membership function of the fuzzy neural network. To enhance the flexibility of neural network, we use the WLS learning to estimate the coefficients of the polynomials. In comparison with ordinary least square commonly used in the design of fuzzy radial basis function neural networks, WLS could come with a different type of the local model in each rule when dealing with the FRBFNN. Since the performance of the FRBFNN model is directly affected by some parameters such as e.g., the fuzzification coefficient used in the FCM, the number of rules and the orders of the polynomials present in the consequent parts of the rules, we carry out both structural as well as parametric optimization of the network. The proposed IMSSA that aims at the simultaneous minimization of complexity and the maximization of accuracy is exploited here to optimize the parameters of the model. Experimental results illustrate that the proposed neural network leads to better performance in comparison with some existing neurofuzzy models encountered in the literature.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 1996년도 춘계학술대회 논문집
• /
• pp.24-29
• /
• 1996

The seniconductor, which is precision product, requires many inspection processes. The surface conditions of the semiconductor chip effect on the functions of the semiconductors. The defects of the chip surface is crack or void. Because general inspection method requires many inspection processes, the inspection system which searches immediately and preciselythe defects of the semiconductor chip surface. We propose the inspection method by using the computer vision system. This study presents an image processing algorithm for inspecting the surface defects(crack, void)of the semiconductor test samples. The proposed image processing algorithm aims to reduce inspection time, and to analyze those experienced operator. This paper regards the chip surface as random texture, and deals with the image modeling of randon texture image for searching the surface defects. For texture modeling, we consider the relation of a pixel and neighborhood pixels as noncasul model and extract the statistical characteristics from the radom texture field by using the 2D AR model(Aut oregressive). This paper regards on image as the output of linear system, and considers the fidelity or intelligibility criteria for measuring the quality of an image or the performance of the processing techinque. This study utilizes the variance of prediction error which is computed by substituting the gary level of pixel of another texture field into the two dimensional AR(autoregressive model)model fitted to the texture field, estimate the parameter us-ing the PAA(parameter adaptation algorithm) and design the defect detection filter. Later, we next try to study the defect detection search algorithm.

• 한국통신학회논문지
• /
• 제26권11A호
• /
• pp.1925-1938
• /
• 2001

본 논문에서는 표준 비디오 부호화기를 위한 블럭 정합 방식을 제안하였다. 일반적으로 기존 방식에 사용되는 광역-협역 방식이 아닌 \"슬라이스 경쟁\`이라는 새로운 개념이 도입되었다. 기존의 SAD의 누적 방식인 순차 방식에서 확산 방식으로 변경함으로써 SAD증가 추이의 선형성이 확보되므로, 누적 초기에 움직임 벡터로서 가능성이 낮은 후보들을 미리 제거하여 불필요한 계산량을 줄이는 방식이다. 그리고 움직임 벡터 예측방식과 적응적 탐색 영역개념을 도입하여 블럭 정합 방식을 효율적으로 지원하였다. 이 두 방식의 도입으로 약 13%의 계산량 감소가 발생하였으며, 최종적으로 기존의 고속 블럭 정합 방식들과 비교하면 39%~77%의 SAD 누적 횟수가 감소되었다. 그리고 다양한 테스트 영상에 대하여, 평균 MAD는 항상 낮으며, 전역 탐색 블럭 정합 방식에 가장 근접한 결과를 얻었다. 얻었다.

• 한국경영과학회지
• /
• 제16권2호
• /
• pp.86-102
• /
• 1991

The purpose of this paper is to present a branch and bound algorithm for the hierarchical transportation network design problem in 2-level directed networks. This problem is to find the least cost of hierarchical transportation networks which consist of a primary path and a secondary path. The primary path is a simple path from a prespecified orgin node to a prespecified terminal node. All nodes must be either a transsipment node on the primary path or connected to that path via secondary arcs. This problem is formulated to a 0-1 inter programming problem with assignment and illegal subtour elimination equations as constaints. We show that the subproblem relaxing subtour elimination constraints is transformed to a linear programming problem by means of the totally unimodularity. Optimal solutions of this subproblem are polynoially obtained by the assignment algorithm and complementary slackness conditions. Therefore, the optimal value of this subproblme is used as a lower bound. When an optimal solution of the subproblem has an illegal subtour, a better disjoint rule is adopted as the branching strategy for reducing the number of branched problems. The computational comparison between the least bound rule and the depth first rule for the search strategy is given.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1111-1130
• /
• 2016

Cooperative communications can significantly improve the wireless transmission performance with the help of relay nodes. In cooperative communication networks, relay selection and power allocation are two key issues. In this paper, we propose a relay selection and power allocation scheme RS-PA-PSACO (Relay Selection-Power Allocation-Particle Swarm Ant Colony Optimization) based on PSACO (Particle Swarm Ant Colony Optimization) algorithm. This scheme can effectively reduce the computational complexity and select the optimal relay nodes. As one of the swarm intelligence algorithms, PSACO which combined both PSO (Particle Swarm Optimization) and ACO (Ant Colony Optimization) algorithms is effective to solve non-linear optimization problems through a fast global search at a low cost. The proposed RS-PA-PSACO algorithm can simultaneously obtain the optimal solutions of relay selection and power allocation to minimize the SER (Symbol Error Rate) with a fixed total power constraint both in AF (Amplify and Forward) and DF (Decode and Forward) modes. Simulation results show that the proposed scheme improves the system performance significantly both in reliability and power efficiency at a low complexity.