• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.407-412
• /
• 2007

본 논문에서는 비선형 블라인드 채널등화기의 구현을 위하여 가우시안 가중치(gaussian weights)를 이용한 개선된 퍼지 클러스터(Modified Fuzzy C-Means with Gaussian Weights: MFCM_GW) 알고리즘을 제안한다. 제안된 알고리즘은 기존 FCM 알고리즘의 유클리디언 거리(Euclidean distance) 값 대신 Bayesian Likelihood 목적함수(fitness function)와 가우시안 가중치가 적용된 멤버쉽 매트릭스(partition matrix)를 이용하여, 비선형 채널의 출력으로 수신된 데이터들로부터 최적의 채널 출력 상태 값(optimal channel output states)들을 직접 추정한다. 이렇게 추정된 채널 출력 상태 값들로 비선형 채널의 이상적 채널 상태(desired channel states) 벡터들을 구성하고, 이를 Radial Basis Function(RBF) 등화기의 중심(center)으로 활용함으로써 송신된 데이터 심볼을 찾아낸다. 실험에서는 무작위 이진 신호에 가우시안 잡음이 추가된 데이터를 사용하여 기존의 Simplex Genetic Algorithm(GA), 하이브리드 형태의 GASA(GA merged with simulated annealing (SA)), 그리고 과거에 발표되었던 MFCM 등과 그 성능을 비교 분석하였으며, 가우시안 가중치가 적용된 MFCM_GW를 이용한 채널등화기가 상대적으로 정확도와 속도 면에서 우수함을 보였다.

• Journal of the Korea Convergence Society
• /
• v.11 no.2
• /
• pp.1-8
• /
• 2020

In this paper, we propose an optimal path search algorithm between each node and midpoint that applies the time weighting. Services for using a location of mid point usually provide a mid point location-based on the location of users. There is a problem that is not efficient in terms of time because a location-based search method is only considered for location. To solve the problem of the existing location-based search method, the proposed algorithm sets the weights between each node and midpoint by reflecting user's location information and required time. Then, by utilizing that, it is possible to search for an optimum path. In addition, to increase the efficiency of the search, it ensures high accuracy by setting weights adaptively to the information given. Experimental results show that the proposed algorithm is able to find the optimal path to the midpoint compared with the existing method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.2 no.1
• /
• pp.21-25
• /
• 1996

In this paper we suggest a general purpose RNN training algorithm which is derived on the optimal control concepts and variational methods. First, learning is regared as an optimal control problem, then using the variational methods we obtain optimal weights which are given by a two-point boundary-value problem. Finally, the modified gradient descent algorithm is applied to RNN for on-line training. This algorithm is intended to be used on learning complex dynamic mappings between time varing I/O data. It is useful for nonlinear control, identification, and signal processing application of RNN because its storage requirement is not high and on-line learning is possible. Simulation results for a nonlinear plant identification are illustrated.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.115-130
• /
• 1995

This paper considers a single machine nonpreemptive scheduling problem with a given common due date. In the problem, the optimal job sequence is sought to minimize the sum of earliness/tardiness and flow time measures in the situation where all jobs are available at time zero, and weights per unit length of earliness/tardiness and flow time are V and W, respectively. Some dominant solution properties are characterized to deriva both an optimal starting time for an arbitrary sequence and sequence improvement rules. The optimal schedule is found to the case W .geq. V/. By the way, it is difficult to find the optimal schedule for the case W < V. Therefore, the derived properties are put on together to construct a heuristic solution algorithm for the case W < V, and its effectiveness is rated at the mean relative error of about 3% on randomly generated numerical problems.

• Proceedings of the Safety Management and Science Conference
• /
• 2000.11a
• /
• pp.251-254
• /
• 2000

The critical problem in dealing with multiple characteristics is how to compromise the conflict among the selected levels of the design parameters for each individual characteristic. In this study, First, Methodology using SN ratio optimized by univariate technique is proposed and a parameter design procedure to achieve the optimal compromise among several different response variables is developed. Second, to solve the issue on the optimal design for multiple quality characteristics, this study modelled the expected loss function with cross-product terms among the characteristics and derived range of the coefficients of the terms. The model will be used to determine the global optimal design parameters where there exists the conflict among the characteristics, which shows difference in optimal design parameters for the individual characteristics. Third, this paper propose a decision model to incorporates the values assigned by a group of experts on different factors in weighting decision of characteristic. Using this model, SN ratio of taguchi method for each of subjective factors as well as values of weights are used in this comprehensive method for weighting decision of characteristic.

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.15 no.3
• /
• pp.231-237
• /
• 2017

The present study researched and analyzed decontamination technology for decommissioning a nuclear power plant. The decision-making technique (EXPERT-CHOICE) was used to evaluate and select the optimal decontamination technology. In principle, this evaluation method is generally performed by a group of experts in the relevant field. The results of the weights were calculated by multiplying the weights with regard to each criterion and evaluation score. The evaluation scores were categorized into 3 ranges (high, medium, and low), and each range was weighted for differentiation. The level of the technology analysis was improved by additionally quantifying the weights with regard to each criterion and subdividing criteria into subcriteria. The basic assumption of the evaluation was that the weight values would decided on in an expert survey and assigned to each criterion. The evaluation criteria followed high weight for the 'High' range. Accordingly, H, M, and L were assigned weights of 10:5:1, respectively. This was based on the EXPERT-CHOICE optimal analysis. The minimum and maximum values were excluded, and the average value was used as the evaluation value for each scenario.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.2
• /
• pp.158-165
• /
• 2003

Image similarity is often decided by computing the distance between two feature vectors. Unfortunately, the feature vector cannot always reflect the notion of similarity in human perception. Therefore, most current image retrieval systems use weights measuring the importance of each feature. In this paper new initial weight selection and update rules are proposed for image retrieval purpose. In order to obtain the purpose, database images are first divided into groups based on human perception and, inner and outer query are performed, and, then, optimal feature weights for each database images are computed through searching the group where the result images among retrieved images are belong. Experimental results on 2000 images show the performance of proposed algorithm.

• Journal of Soil and Groundwater Environment
• /
• v.20 no.7
• /
• pp.13-22
• /
• 2015

In this study, we have developed the performance evaluation model for the optimal soil remediation technology selection. Performance evaluation model is composed in the evaluation of two steps. In the first stage, the candidate technologies are derived according to the conditions of drilling, type and concentration of pollutants, and the saturated/unsaturated of target site. In the second stage, each individual candidate technology is evaluated by performance evaluation model. The performance evaluation model has 5 groups of evaluation items and 12 evaluation items which have their own evaluation index and their own weights through the AHP approach surveying 40 experts. From the case study of actual design cases, the applicability of the performance evaluation model was confirmed.

• Journal of the Korean Society for Railway
• /
• v.14 no.6
• /
• pp.489-494
• /
• 2011

In this paper, a method is proposed to evaluate a number of alternatives for light-weight rolling stock recommended from experts in rolling stock and to decide an optimal alternative. At first, many customer needs from various fields in railroad are drawn and weights of customer needs are decided by AHP. Secondly, technical requirements that should be real specifications for light-weight rolling stock are set and weights of technical requirements are decided by QFD. Finally, we evaluate some proposed alternatives and conclude an optimal alternative of light-weight rolling stock with TOPSIS.

• Journal of Korea Game Society
• /
• v.18 no.5
• /
• pp.59-66
• /
• 2018

In this paper, one of the traditional game, Gonu game, is implemented and experimented. The Minimax algorithm was applied as a technique to implement the Gonu game. We proposed an evaluation function to implement game in Minimax algorithm. We analyze the efficiency of algorithm for alpha beta pruning to improve the performance after implementation of Gonu game. Weights were analyzed for optimal analysis that affected the win or loss of the game. For the weighting analysis, a competition of human and computer was performed. We also experimented with computer and computer. As a result, we proposed a weighting value for optimal attack and defense.