• 한국인터넷방송통신학회논문지
• /
• 제13권1호
• /
• pp.143-152
• /
• 2013

주어진 그래프 G=(V,E), n=|V|, m=|E|에 대해 최소절단을 찾는 연구는 공급처 s와 수요처 t가 주어지지 않은 경우와 주어진 경우로 구분된다. s와 t가 주어지지 않은 무방향 가중 그래프에 대한 Stoer-Wagner 알고리즘은 임의의 정점을 고정시키고 최대 인접 순서로 나열하여 마지막 정점의 절단 값과 마지막 2개 정점을 병합하면서 정점을 축소시키는 방법으로 $\frac{n(n-1)}{2}$회를 수행한다. 또한, s와 t가 주어진 그래프에 대한 Ford-Fulkerson 알고리즘은 증대경로를 탐색하여 절단 간선을 결정한다. 더 이상의 증대 경로가 없으면 절단 간선들의 조합으로 최소절단을 결정해야 한다. 본 논문은 단일 s와 t가 주어진 무방향 가중 그래프에 대해 최대인접 병합과 절단값을 동시에 계산하는 방법으로 n-1회 수행으로 단축시켰다. 또한, Stoer-Wagner 알고리즘은 최소 절단을 기준으로 V=S+T로 양분하지 못할 수 있는데 반해 제안된 알고리즘은 정확히 양분시켰다. 제안된 알고리즘은 Ford-Fulkerson의 증대경로를 찾는 수행횟수보다 많이 수행하지만 수행과정에서 최소절단을 결정하는 장점이 있다.

• Journal of Electrical Engineering and Technology
• /
• 제8권3호
• /
• pp.490-498
• /
• 2013

This paper discusses the application of evolutionary multi-objective optimization algorithms namely Non-dominated Sorting Genetic Algorithm-II (NSGA-II) and Modified NSGA-II (MNSGA-II) for solving the Combined Economic Emission Dispatch (CEED) problem with valve-point loading. The valve-point loading introduce ripples in the input-output characteristics of generating units and make the CEED problem as a non-smooth optimization problem. IEEE 57-bus and IEEE 118-bus systems are taken to validate its effectiveness of NSGA-II and MNSGA-II. To compare the Pareto-front obtained using NSGA-II and MNSGA-II, reference Pareto-front is generated using multiple runs of Real Coded Genetic Algorithm (RCGA) with weighted sum of objectives. Furthermore, three different performance metrics such as convergence, diversity and Inverted Generational Distance (IGD) are calculated for evaluating the closeness of obtained Pareto-fronts. Numerical results reveal that MNSGA-II algorithm performs better than NSGA-II algorithm to solve the CEED problem effectively.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국제학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.501-506
• /
• 1993

An efficient solution algorithm of the optimal load distribution problem with joint torque constraints is presented. Multiple robot system where each robot is rigidly grasping a common object is considered. The optimality criteria used is the sum of weighted norm of the joint torque vectors. The maximum and minimum bounds of each joint torque in arbitrary form are considered as constraints, and the solution that reduces the internal force to zero is obtained. The optimal load distribution problem is formulated as a quadratic optimization problem in R, where I is the number of robots. The general solution can be obtained using any efficient numerial method for quadratic programming, and for dual robot case, the optimal solution is given in a simple analytical form.

• 한국정보과학회논문지:시스템및이론
• /
• 제31권7호
• /
• pp.397-401
• /
• 2004

각 에지에 무게(양수, 음수, 0 가능)가 주어진 트리에서, 경로의 에지들의 무게의 합이 비음수이면서 길이가 가장 긴 경로를 구하는 문제를 해결하고자 한다. 차수가 3인 트리에서 가장 긴 비음수 경로를 찾는 Ο(n log n) 시간 알고리즘을 제시한다. n은 트리가 가지는 노드의 수이다.

• Journal of information and communication convergence engineering
• /
• 제15권1호
• /
• pp.7-13
• /
• 2017

We consider a distributed estimation where many nodes remotely placed at known locations collect the measurements of the parameter of interest, quantize these measurements, and transmit the quantized data to a fusion node; this fusion node performs the parameter estimation. Noting that quantizers at nodes should operate in a non-regular framework where multiple codewords or quantization partitions can be mapped from a single measurement to improve the system performance, we propose a low-weight estimation algorithm that finds the most feasible combination of codewords. This combination is found by computing the weighted sum of the possible combinations whose weights are obtained by counting their occurrence in a learning process. Otherwise, tremendous complexity will be inevitable due to multiple codewords or partitions interpreted from non-regular quantized data. We conduct extensive experiments to demonstrate that the proposed algorithm provides a statistically significant performance gain with low complexity as compared to typical estimation techniques.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1988년도 한국자동제어학술회의논문집(국제학술편); 한국전력공사연수원, 서울; 21-22 Oct. 1988
• /
• pp.951-957
• /
• 1988

A collision-free trajectory planning algorithm is proposed to optimally coordinate two robots working in a common 3-D workspace. Each link of the two robots is modeled as a line segment and by their motion priority, one of the two robots is chosen as the master and the other the slave. And the one-step-ahead minimum distance between the two robots is computed by moving the master to the next location on its specified trajectory. Then the nominal trajectory of the slave is modified such that the distance between the next locations of the master and the slave must be larger than a prespecified allowable minimum distance. Here the weighted sum of the trajectory error and the joint motions of the slave is minimized by using the linear programming technique under the constraints that joint angle and velocity limits are not violated. To show the validity of the proposed algorithm, a numerical example is illustrated by employing a two dof's and a three dof's planar robots.

• 한국정보과학회논문지:시스템및이론
• /
• 제33권12호
• /
• pp.880-884
• /
• 2006

각 에지에 무게(양수, 음수, 0 가능)가 주어진 트리에서, 경로의 에지들의 무게의 합이 비음수이면서 길이가 가장 긴 경로를 구하는 문제를 해결하고자 한다. 트리에서 가장 긴 비음수 경로를 찾는 O(n logn) 시간 직렬 알고리즘과 $O(log^2n)$ 시간과 O(n)개의 프로세서를 사용하는 CREW PRAM 병렬 알고리즘을 제시한다. 여기서, n은 트리가 가지는 노드의 수이다.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1996년도 추계학술대회 논문집
• /
• pp.444-449
• /
• 1996

The semiconductor, which is precision product, requires many inspection processes. The surface conditions of the semiconductor chip affect on the functions of the semiconductors. The defects of the chip surface are cracks or voids. As general inspection method requires many inspection procedure, the inspection system which searches immediately and precisely the defects of the semiconductor chip surface is required. We suggest the detection algorithm for inspecting the surface defects of the semiconductor surface. The proposed algorithm first regards the semiconductor surface as random texture and point spread function, and secondly presents the character of texture by linear estimation theorem. This paper assumes that the gray level of each pixel of an image is estimated from a weighted sum of gray levels of its neighbor pixels by linear estimation theorem. The weight coefficients are determined so that the mean square error is minimized. The obtained estimation window(two-dimensional estimation window) characterizes the surface texture of semiconductor and is used to discriminate the defects of semiconductor surface.

• 한국음향학회지
• /
• 제18권6호
• /
• pp.57-64
• /
• 1999

본 논문에서는 잡음이 포함된 음성의 시작점과 끝점을 효율적으로 검출할 수 있는 알고리듬에 대하여 연구하였다. 이를 위해, 웨이브렛 영역에서의 에너지 분포를 고려함으로써 잡음환경하에서도 음성을 검출할 수 있는 새로운 검출 파라미터를 제안하였다. 제안된 끝점검출 파라미터는 웨이브렛 영역에서 세 번째 coarsed 스케일의 표준편차와 가중치를 곱한 첫 번째 detailed 스케일의 표준편차의 합으로 정의하였다. 제안된 끝점검출기의 성능평가를 위해서 다양한 SNR에서 기존방식과 비교하여 시작점과 끝점의 정확도 실험을 수행하였고 HMM 음성인식시스템을 이용하여 인식실험도 수행하였다.

• 전자공학회논문지B
• /
• 제31B권8호
• /
• pp.211-218
• /
• 1994

In this paper we develope a hybrid learning rule to improve the robustness of multi-layer Perceptions. In most neural networks the activation of a neuron is deternined by a nonlinear transformation of the weighted sum of inputs to the neurons. Investigating the behaviour of activations of hidden layer neurons a new learning algorithm is developed for improved robustness for multi-layer Perceptrons. Unlike other methods which reduce the network complexity by putting restrictions on synaptic weights our method based on error-backpropagation increases the complexity of the underlying proplem by imposing it saturation requirement on hidden layer neurons. We also found that the additional gradient-descent term for the requirement corresponds to the Hebbian rule and our algorithm incorporates the Hebbian learning rule into the error back-propagation rule. Computer simulation demonstrates fast learning convergence as well as improved robustness for classification and hetero-association of patterns.