• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.2
• /
• pp.121-133
• /
• 2003

This paper presents a fault location algorithm for a single phase-to-ground fault on 3-terminal transmission systems. The method uses only the local end voltage and current signals. Other currents used for the algorithm are estimated by current distribution factors and the local end current. Negative sequence current is used to remove the effect of load current. Five distance equations based on Kirchhoff's voltage law are established for the location algorithm which can be applied to a parallel transmission line having a teed circuit. Separating the real and imaginary parts of each distance equation, final nonlinear equations that are functions of the fault location can be obtained. The Newton-Raphson method is then applied to calculate the estimated fault location. Among the solutions, a correct fault distance is selected by the conditions of the existence of solution. With the results of extensive S/W and H/W simulation tests, it was verified that the proposed algorithm can estimate an accurate fault distance in a 154kV model system.

• Journal of Digital Contents Society
• /
• v.18 no.5
• /
• pp.969-976
• /
• 2017

This paper proposes the learning method of an artificial neural network and a convolutional neural network using the WFSO algorithm developed as an optimization algorithm. Since the optimization algorithm searches based on a number of candidate solutions, it has a drawback in that it is generally slow, but it rarely falls into the local optimal solution and it is easy to parallelize. In addition, the artificial neural networks with non-differentiable activation functions can be trained and the structure and weights can be optimized at the same time. In this paper, we describe how to apply WFSO algorithm to artificial neural network learning and compare its performances with error back-propagation algorithm in multilayer artificial neural networks and convolutional neural networks.

• Structural Engineering and Mechanics
• /
• v.23 no.1
• /
• pp.63-74
• /
• 2006

In this paper, the scattering of harmonic elastic anti-plane shear waves by two collinear cracks in functionally graded materials is investigated by means of nonlocal theory. The traditional concepts of the non-local theory are extended to solve the fracture problem of functionally graded materials. To overcome the mathematical difficulties, a one-dimensional non-local kernel is used instead of a two-dimensional one for the anti-plane dynamic problem to obtain the stress field near the crack tips. To make the analysis tractable, it is assumed that the shear modulus and the material density vary exponentially with coordinate vertical to the crack. By use of the Fourier transform, the problem can be solved with the help of a pair of triple integral equations, in which the unknown variable is the displacement on the crack surfaces. To solve the triple integral equations, the displacement on the crack surfaces is expanded in a series of Jacobi polynomials. Unlike the classical elasticity solutions, it is found that no stress singularities are present at crack tips.

• 제어로봇시스템학회:학술대회논문집
• /
• 1998.10a
• /
• pp.30-34
• /
• 1998

Path Planning is one of the important fields in robot technologies. Local path planning may be done in on-line modes while recognizing an environment of robot by itself. In dynamic environments to obtain fluent information for environments vision system as a sensing equipment is a one of the most necessary devices for safe and effective guidance of robots. If there is a predictor that tells what future sensing outputs will be, robot can respond to anticipated environmental changes in advance. The tracking of obstacles has a deep relationship to the prediction for safe navigation. We tried to deal with active contours, that is snakes, to find out the possibilities of stable tracking of objects in image plane. Snakes are defined based on energy functions, and can be deformed to a certain contour form which would converge to the minimum energy states by the forces produced from energy differences. By using point algorithm we could have more speedy convergence time because the Brent's method gives the solution to find the local minima fast. The snake algorithm may be applied to sequential image frames to track objects in the images by these characteristics of speedy convergence and robust edge detection ability.

• Journal of Digital Convergence
• /
• v.9 no.3
• /
• pp.191-202
• /
• 2011

Public agencies and local governments have been installing CCTV cameras for the prevention of crime, traffic jam, and unauthorized waste. Additionally, national government agencies and schools, a special corporation by special law, local construction and industrial company installed CCTV cameras of their own and are operating them. Various types of CCTV systems disclosed technical heterogeneity. In February, 2011, Ministry of Public Administration and Security presented guidelines for building an integrated control center. This study examines the case of Busan by using the administrative guidelines. Busan integrated CCTV control center among themselves, police agency and fire department. This study looks into the potential problems with the integration process of CCTV cameras and proposes a solution to them.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.502-512
• /
• 2016

The wireless carrier sense multiple access with collision detection (WCSMA/CD) and carrier sense multiple access with collision resolution (CSMA/CR) protocols are considered representative distributed collision detection protocols for fully connected dense wireless local area networks. These protocols identify collisions through additional short-sensing within a collision detection (CD) period after the start of data transmission. In this study, we analyze their throughput numerically and show that the throughput has a trade-off that accords with the length of the CD period. Consequently, we obtain the optimal length of the CD period that maximizes the throughput as a closed-form solution. Analysis and simulation results show that the throughput of distributed collision detection protocols is considerably improved when the optimal CD period is allocated according to the number of stations and the length of the transmitted packet.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.9
• /
• pp.2087-2093
• /
• 2014

In this paper, an orthogonal matching pursuit (OMP) method combined with genetic algorithm (GA), named GAOMP, is proposed for sparse signal recovery. Some recent greedy algorithms such as SP, CoSaMP, and gOMP improved the reconstruction performance by deleting unsuitable atoms at each iteration. However they still often fail to converge to the solution because the support set could not avoid the local minimum during the iterations. Mutating the candidate support set chosen by the OMP algorithm, GAOMP is able to escape from the local minimum and hence recovers the sparse signal. Experimental results show that GAOMP outperforms several OMP based algorithms and the $l_1$ optimization method in terms of exact reconstruction probability.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.35 no.11
• /
• pp.1386-1398
• /
• 2011

Slow fashion can be viewed as an activism that provides an alternative solution to the problematic issues of fast fashion in a practical sense; however, (from a theoretical point of view) it is a fashion phenomenon arising from the criticism of an accelerating society. Slowness emphasizes the virtues of moderation. Slowness refers to the recovery of human ethics that have been neglected due to the goal-oriented nature of an accelerating society. Slowness can solve the problem of conformity and discrimination in society through pluralism and respect for local indigenousness. The characteristics of slow fashion can be defined by the aesthetic values of circularity, sustainability, moderation, expressivity and convergence. This includes the beauty of circularity (which views the relationships of all processes as organic), the beauty of sustainability (which ensures the maintenance of continuous emotions and the durability of products that can be promoted through slow processes), the beauty of moderation (which places importance on spiritual values and the moderate use of materials), and the beauty of expressivity (which plays the role of a social messenger that facilitates social assertion). These combined values present the beauty of convergence such as the harmony of local communities and the world in a blend of the old and the new with an exchange between producers and consumers.

• Korean Journal of Remote Sensing
• /
• v.25 no.3
• /
• pp.295-309
• /
• 2009

In this study, an iterative maximum a posteriori (MAP) approach using a Bayesian model of Markovrandom field (MRF) was proposed for despeckling images that contains speckle. Image process is assumed to combine the random fields associated with the observed intensity process and the image texture process respectively. The objective measure for determining the optimal restoration of this "double compound stochastic" image process is based on Bayes' theorem, and the MAP estimation employs the Point-Jacobian iteration to obtain the optimal solution. In the proposed algorithm, MRF is used to quantify the spatial interaction probabilistically, that is, to provide a type of prior information on the image texture and the neighbor window of any size is defined for contextual information on a local region. However, the window of a certain size would result in using wrong information for the estimation from adjacent regions with different characteristics at the pixels close to or on boundary. To overcome this problem, the new method is designed to use less information from more distant neighbors as the pixel is closer to boundary. It can reduce the possibility to involve the pixel values of adjacent region with different characteristics. The proximity to boundary is estimated using a non-uniformity measurement based on standard deviation of local region. The new scheme has been extensively evaluated using simulation data, and the experimental results show a considerable improvement in despeckling the images that contain speckle.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.3
• /
• pp.1-7
• /
• 2019

It is one of the known methods to obtain the optimal solution using the Ant Colony Optimization Algorithm for the Traveling Salesman Problem (TSP), which is a combination optimization problem. In this paper, we solve the TSP problem by proposing an improved new ant colony optimization algorithm that combines genetic algorithm mutations in existing ant colony optimization algorithms to solve TSP problems in many cities. The new ant colony optimization algorithm provides the opportunity to move easily fall on the issue of developing local optimum values of the existing ant colony optimization algorithm to global optimum value through a new path through mutation. The new path will update the pheromone through an ant colony optimization algorithm. The renewed new pheromone serves to derive the global optimal value from what could have fallen to the local optimal value. Experimental results show that the existing algorithms and the new algorithms are superior to those of existing algorithms in the search for optimum values of newly improved algorithms.