• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.12
• /
• pp.640-647
• /
• 2002

In this paper, we consider the problems related to the edge visibility on a reconfigurable mesh(in short, RMESH). The following basic problems related to the edge visibility are considered: First, determine if a given polygon is visible from a specific edge, Second, find all edges from which a given polygon is visible. Third, compute the visibility polygon from a specific edge of a given polygon. In this paper, we consider the following problem in order to solve these problems in constant time: given two edges e and f of a simple polygon p, compute the maximal interval of f which is visible from e. We present a constant time algorithm for the problem on an N-N RMESH, where N is the number of vertices of P. Applying the algorithm, we can solve the above three problems in a constant time on a reconfigurable mesh. Specially, we can solve the third problem in a constant time on an N-$N_2$ RMESH.

• The KIPS Transactions:PartA
• /
• v.11A no.3
• /
• pp.173-180
• /
• 2004

Quadtree, which 11 a hierarchical data structure, is a very important data structure to represent images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related to quadtrees. The region expansion is an operation to expand images by a given distance and the scaling If an operation to scale images by a given scale factor. In this paper, we present algorithms to perform the region expansion and scaling of images represented by quadtrees, using three-dimensional n${\times}$n${\times}$n processors on RMESH(Reconfigurable MESH). These algorithms have constant time complexities by using efficient basic operations to route the locational codes of quadtree on the hierarchical structure of n${\times}$n${\times}$n RMESH.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.4
• /
• pp.996-1007
• /
• 1996

In this paper, a blind adaptation method for a decision feedback equalizer (DFE) is proposed to deal with nominimum phase channels. This equalizer is composed of a linear transversal filter and a prediction error filter which are trained separately using constant modulus and decision feedback prediction algorithms, respectively, during the learnign time. The proposed algorithm guaranetees the DFE to converge to a suboptimal point on the condition that a linear transversal of the proposed scheme is illustrated and the performance is compared with conventional blind equlization algorithms.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.2
• /
• pp.303-311
• /
• 2012

In this study, we introduce a dynamic process model as well as the design methodology of optimized fuzzy controller for its efficient application to vacuum production system to produce a semiconductor, solar module and display and so on. In a vacuum control field, PID control method is widely used from the viewpoint of simple structure and preferred performance. But, PID control method is very sensitive to the change of environment of control system as well as the change of control parameters. Therefore, it's difficult to get a preferred performance results from target system which has a complicated structure and lots of nonlinear factors. To solve such problem, we propose the design methodology of an optimized fuzzy PID controller through a following series of steps. First a dynamic characteristic of the target system is analyzed through a series of experiments. Second the process model is built up and its characteristic is compared with real process. Third, the optimized fuzzy PID controller is designed using genetic algorithms. Finally, the fuzzy controller is applied to target system and then its performance is compared with that of other conventional controllers(PID, PI, and Fuzzy PI controller). The performance of the proposed fuzzy controller is evaluated in terms of auto-tuned control parameters and output responses considered by ITAE index, overshoot, rise time and steady state time.

• Journal of the Korean Data and Information Science Society
• /
• v.23 no.6
• /
• pp.1259-1269
• /
• 2012

Cloud computing has rapidly become a new infrastructure for organizations to reduce their capital cost in IT investment and to develop planetary-scale distributed applications. One of the fundamental challenges in geographically distributed clouds is to provide efficient algorithms for supporting inter-cloud data management and dissemination. In this paper, we propose a geographic group quorum system (GGQS)-based hybrid algorithm for improving the interoperability of inter-cloud in time-critical event dissemination service, such as computing policy updating, message sharing, event notification and so forth. The proposed algorithm first organizes these distributed clouds into a geographic group quorum overlay to support a constant event dissemination latency. Then it uses a hybrid protocol that combines geographic group-based broad-cast with quorum-based multicast. Our numerical results show that the GGQS-based hybrid algorithm improves the efficiency as compared with Chord-based, Plume an GQS-based algorithms.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.853-858
• /
• 1993

The error back-propagation(BP) algorithm is widely used for finding optimum weights of multi-layer neural networks. However, the critical drawback of the BP algorithm is its slow convergence of error. The major reason for this slow convergence is the premature saturation which is a phenomenon that the error of a neural network stays almost constant for some period time during learning. An inappropriate selections of initial weights cause each neuron to be trapped in the premature saturation state, which brings in slow convergence speed of the multi-layer neural network. In this paper, to overcome the above problem, Micro-Genetic algorithms(.mu.-GAs) which can allow to find the near-optimal values, are used to select the proper weights and slopes of activation function of neurons. The effectiveness of the proposed algorithms will be demonstrated by some computer simulations of two d.o.f planar robot manipulator.

• Proceedings of the KIEE Conference
• /
• 1991.11a
• /
• pp.357-360
• /
• 1991

In this paper, we have introduced a network and showed how this can be realised as an adaptive equalizer. The walsh equlizer is built from a set of Walsh-Block pulse functions and LMS algorithms with the optimal convergence factor(C.F.). The convergence and the adaptation speed of this algorithms depends on the proper choice of a design factor $\mu$ called the C.F.. Conventional adaptation techniques use the fixed time constant C.F. by the method of trial and error. In this paper, we propose to adaptive C.F. which are optimally tailored to adapt C.F. in real time so that their values are kept optimum for a new set of input variables.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.41 no.8
• /
• pp.914-921
• /
• 1992

In this paper, we introduce a Walsh network and an LMS algorithm, and show how these can be realized as an adaptive equalizer. The Walsh network is built from a set of Walsh and Block pulse functions. In the LMS algorithm, the convergence factor is an important design parameter because it governs stability and convergence speed, which depend on the proper choice of the convergence facotr. The conventional adaptation techniques use a fixed time constant convergence factor by the method of trial and error. In this paper, we propose an optimal method in the choice of the convergence factor. The proposed algorithm depends on the received signal and the output of the Walsh network in real time.

• The Journal of the Acoustical Society of Korea
• /
• v.34 no.5
• /
• pp.394-402
• /
• 2015

CMA (Constant Modulus Algorithm) is one of the well-known algorithms in blind acoustic channel equalization. Generally, CMA converges slowly and the speed of convergence is dependent on a step-size in the CMA procedure. Many researches have tried to speed up the convergence speed by applying a variable step-size to CMA, e.g. the orthogonal projection CMA and algebraic optimal step-size CMA. In this paper, we summarize these two algorithms, and we propose a new CMA with improved convergence performance. The improvement comes from the switching between the orthogonal projection CMA and algebraic optimal step-size CMA. In simulation results, we show the performance improvement in the time invariant channels as well as in time varying channel.

• The KIPS Transactions:PartA
• /
• v.16A no.5
• /
• pp.319-326
• /
• 2009

Since string operations were applied to computational biology area, various data structures and algorithms for computing efficient string operations have been studied. The longest common substring problem is an operation to find the longest matching substring in more than two strings, and maximal repeat of string problem is an operation to find substrings repeated more than once in the given string. These operations are importantly used in the string processing area such as pattern matching and likelihood measurement. In this paper, we present algorithms to compute the longest common substring of two strings and to find the maximal repeat of string using three-dimensional $n{\times}n{\times}n$ processors on RMESH(Reconfigurable MESH). Our algorithms have O(1) time complexity.