• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.1
• /
• pp.141-154
• /
• 1996

This paper presents a similarity coefficient based approach to the problem of machine-part grouping for cellular manufacturing. The method uses relevant production data such as part type, production volume, routing sequence to make machine cells and part families for cell formation. A new similarity coefficient using weighted factors is introduced and an algorithm for formation of machine cells and part families is developed. A comparative study of two similarity coefficient methods, Gupta and Seifoddini's method and the proposed method, is conducted.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.16 no.28
• /
• pp.93-101
• /
• 1993

In this paper, two adaptive exponentially weighted moving avenge control chart schemes which available for real-time are proposed. The weighting coefficient is estimated using a recursive kalman filter algorithm. Simulated average run lengths indicate the proposed schemes are sensitive to process shifts And their performance is comparable to CUSUM control chart and customary EWMA control chart.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.39-49
• /
• 2002

This paper proposes the MAWUPC (Motion Adaptive Weighted Unmatched Pixel Count) algorithm to track multiple objects of similar color The MAWUPC algorithm has the new method that combines color and motion effectively. We apply the MAWUPC algorithm to face and hand tracking against complex background in an image sequence captured by using single camera. The MAWUPC algorithm is an improvement of previously proposed AWUPC (Adaptive weighted Unmatched Pixel Count) algorithm based on the concept of the Moving Color that combines effectively color and motion information. The proposed algorithm incorporates a color transform for enhancing a specific color, the UPC(Unmatched Pixel Count) operation for detecting motion, and the discrete Kalman filter for reflecting motion. The proposed algorithm has advantages in reducing the bad effect of occlusion among target objects and, at the same time, in rejecting static background objects that have a similar color to tracking objects's color. This paper shows the efficiency of the proposed MAWUPC algorithm by face and hands tracking experiments for several image sequences that have complex backgrounds, face-hand occlusion, and hands crossing.

• Journal of Information Technology Applications and Management
• /
• v.20 no.3_spc
• /
• pp.219-230
• /
• 2013

Real time accessiblity and agility in Ubiquitous-commerce is required under ubiquitous computing environment. The Research has been actively processed in e-commerce so as to improve the accuracy of recommendation. Existing Collaborative filtering (CF) can not reflect contents of the items and has the problem of the process of selection in the neighborhood user group and the problems of sparsity and scalability as well. Although a system has been practically used to improve these defects, it still does not reflect attributes of the item. In this paper, to solve this problem, We can use a implicit method which is used by customer's data and purchase history data. We propose a new clustering method of weighted preference for customer using k-means clustering and Bayesian network in order to improve the accuracy of recommendation. To verify improved performance of the proposed system, we make experiments with dataset collected in a cosmetic internet shopping mall.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.6
• /
• pp.106-118
• /
• 1998

The study concerns a design procedure of rule-based systems. The proposed rule-based fuzzy modeling implements system structure and parameter identification in the efficient from of "IF..., THEN..." statements, and exploits the theory of system optimization and fuzzy implication rules. The method for rule-based fuzzy modeling concerns the from of the conclusion part of the the rules that can be constant. Both triangular and Gaussian-like membership function are studied. The optimization hinges on an autotuning algorithm that covers as a modified constrained optimization method known as a complex method. The study introduces a weighted performance index (objective function) that helps achieve a sound balance between the quality of results produced for the training and testing set. This methodology sheds light on the role and impact of different parameters of the model on its performance. The study is illustrated with the aid of two representative numerical examples.

• ETRI Journal
• /
• v.36 no.1
• /
• pp.171-174
• /
• 2014

In weighted bit-flipping-based algorithms for low-density parity-check (LDPC) codes, due to the existence of overconfident incorrectly received bits, the metric values of the corresponding bits will always be wrong in the decoding process. Since these bits cannot be flipped, decoding failure results. To solve this problem, an improved parallel weighted bit flipping algorithm is proposed. Specifically, a reliability-saturation strategy is adopted to increase the flipping probability of the overconfident incorrectly received bits. Simulation results show that the error floor of LDPC codes is greatly lowered.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.3
• /
• pp.37-49
• /
• 1993

In this paper, the TSP(traveling salesman problem) which its costs(distance) between nodes are defined with Max($\bar{x}$, $\bar{y}$) has been dealt. In order to find a satisfactory solution for this kind of problem, we generate weighted matrix, and then develope a new heuristic problem solving method using the weighted matrix. Also we analyze the effectiveness of the newly developed heuristic method comparing it with other heuristic algorithm already exists for Euclidean TSP. Finally, we apply a new developed algorithm to real Max($\bar{x}$,$\bar{y}$) TSP such as PCB inserting.

• Journal of applied mathematics & informatics
• /
• v.9 no.2
• /
• pp.607-620
• /
• 2002

In this paper, we consider the updating problems to reconstruct the biconnected-components and to reconstruct the weighted shortest path in response to the topology change of the network. We propose two distributed algorithms. The first algorithm solves the updating problem that reconstructs the biconnected-components after the several processors and links are added and deleted. Its bit complexity is O((n'+a+d)log n'), its message complexity is O(n'+a+d), the ideal time complexity is O(n'), and the space complexity is O(e long n+e' log n'). The second algorithm solves the updating problem that reconstructs the weighted shortest path. Its message complexity and ideal-time complexity are $O(u^2+a+n')$ respectively.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.2
• /
• pp.102-109
• /
• 2002

This paper proposes a new design algorithm to optimize the withdrawal weighted SAW ladder devices, Withdrawal weighting on SAW resonators gives enhanced bandwidth and transition band characteristics, so an optimization algorithm was developed for ladder type SAW filters. To illustrate the validity of the technique, this method was applied to the design of RF band CDMA TX SAW filters, and the design results were confirmed to show good agreement with experimental performance.

• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.80-85
• /
• 2008

Images are often corrupted by noises during signal acquisition and transmission. Among those noises, additive white Gaussian noise (AWGN) and impulse noise are most representative. For different types of noise have different characters, how to remove them separately from degraded image is one of the most fundamental problems. Thus, a modified image restoration algorithm is proposed in this paper, which can not only remove impulse noise of random values, but also remove the AWGN selectively. The noise detection step is by calculating the intensity difference and the spatial distance between pixels in a mask. To divide two different noises, the method is based on three weighted parameters. And the weighted parameters in the filtering mask depend on spatial distances, positions of impulse noise and standard deviation of AWGN. We also use the peak signal-to-noise ratio (PSNR) to evaluate restoration performance, and simulation results demonstrate that the proposed method performs better than conventional median-type filters, in preserving edge details.