• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.6
• /
• pp.26-37
• /
• 2001

In order to improve the several problems of the general backpropagation, we propose a method using a fuzzy logic system for automatic tuning of the activation function gain in the backpropagation. First, we researched that the changing of the gain of sigmoid function is equivalent to changing the learning rate, the weights, and the biases. The inputs of the fuzzy logic system were the sensitivity of error respect to the last layer and the mean sensitivity of error respect to the hidden layer, and the output was the gain of the sigmoid function. In order to verify the effectiveness of the proposed method, we performed simulations on the parity problem, function approximation, and pattern recognition. The results show that the proposed method has considerably improved the performance compared to the general backpropagation.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.21 no.4
• /
• pp.323-330
• /
• 2003

GIS-based applications for route guidance are increasingly developed recently, but most of them are for self$.$driven cars. Although some of them are intended for public transportation, they show limitations in dealing with time constraints problems taken place in transfer areas. Developing a public transportation guidance system requires the fallowing aspects: (i) people may change transportation means not only within the same type but also among different modes such as between buses and subways, and (ii) the system should take into account the time taken in transfer from one mode to the other. This study suggests the framework for developing a public transportation guidance system that generates optimized paths in the transportation network of mixed means including buses, subways and other modes. For this study, the Genetic Algorithms are used to find the best routes that take into account transfer time and other service-time constraints. The method for constructing the data structure in the GIS was also suggested.

• Journal of the Korea Convergence Society
• /
• v.11 no.5
• /
• pp.175-182
• /
• 2020

The calculation of the optimal trajectory of the stepped top-down robot was made using a genetic algorithm and a computational torque controller. First, the total energy efficiency was minimized using the Red-Cold Generic Algorithm (RCGA) consisting of reproductive, cross, and mutation. The reproducibility condition related to the position assembly of the start and end of the stride and the joints, angles, and angular velocities are linear constraints. Next, the unequal constraint accompanies the condition for preventing the collision of the swing leg at the corner with the outer surface of the stairs, the condition of the knee joint for preventing kinematic peculiarity, and the condition of no moment in safety in the traveling direction. Finally, the angular trajectory of each joint is defined by fourth-order polynomial whose coefficient is to approximate chromosomes. This is to approximate walking. In this study, the energy efficiency of the optimal trajectory was analyzed by computer simulation through a biped robot with seven degrees of freedom composed of seven links.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1197-1209
• /
• 2016

As Indoor Positioning System demands due to increased penetration and utilization of smart device, Indoor Positioning System using Wi-Fi or BLE(Bluetooth Low Energy) beacon takes center stage. In this paper, a terminal location of the user is calculated through Microscopic Trilateration using RSSI based on BLE. In the next step, a fingerprinting map appling approximate value of Microscopic Trilateration increases an efficiency of computation amount and energy for Indoor Positioning System. I suggest Indoor Positioning Algorithm based on BLE fingerprinting considering efficiency of energy by conducting precise Trilateration that assure user's terminal position by using AP(Access Point) surrounding targeted fingerprinting cells. And This paper shows experiment and result based on An Suggesting Algorithm in comparison with a fingerprinting based on BLE and Wi-Fi that be used for Indoor Positioning System.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.13 no.1
• /
• pp.41-45
• /
• 2008

This paper deals with the estimation method on the initial pole position of a z-axis permanent magnet linear synchronous motor(PMLSM) without magnetic pole sensors such as Hall sensors. The proposed method takes account of the gravitational force at z-axis and also the load conditions. The algorithm consists of two steps. The first step is to approximately estimate the initial q-axis by monitoring the movements due to the test current at predefined different test q-axes. The second step is to estimate the real q-axis as accurately as possible by using the outputs corresponding to torques due to the test current at three different test q-axes in order to avoid the effect of load mass variations. Experimental results on the z-axis PMLSM show good estimation characteristics of the proposed method irrespective of load mass conditions.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.2
• /
• pp.704-710
• /
• 2017

Our research team is developing a 6-DOF manipulator that is adequate for the narrow workspace of press forming processes. This paper addresses the task sequence optimization methods for the manipulator to minimize the task-finishing time. First, a kinematic model of the manipulator is presented, and the anticipated times for moving among the task locations are computed. Then, a mathematical model of the task sequence optimization problem is presented, followed by a comparison of three meta-heuristic methods to solve the optimization problem: an ant colony system, simulated annealing, and a genetic algorithm. The simulation shows that the genetic algorithm is robust to the parameter settings and has the best performance in both minimizing the task-finishing time and the computing time compared to the other methods. Finally, the algorithms were implemented and validated through a simulation using Mathworks' Matlab and Coppelia Robotics' V-REP (virtual robot experimentation platform).

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.129-140
• /
• 2002

In this paper, we consider the problem of packet transmission in a wavelength division multiplexed(WDM) optical network. Our network model assumes that receivers are fixed-tuned and transmitters are tunable such that optical lasers assigned to transmitters have limited access to the network bandwidth: hence each node must be equipped with multiple optical lasers and/or multiple optical filters in order to maintain a single-hop network. We first analyze scheduling all-to-all packet transmissions and present optimum scheduling for all-to-all packet transmissions. We then extend the analysis to the case of arbitrary traffic demands. We show that the scheduling with arbitrary traffic demand is NP-hard. A heuristic algorithm based on list scheduling is presented. The upper bound so obtained is compared with the lower bound and provides performance guarantees with arbitrary demands. The result are applicable to arbitrary tuning delay, arbitrary number of wavelength channels and optical lasers of arbitrary tuning ranges.

• Korean Journal of Remote Sensing
• /
• v.15 no.3
• /
• pp.195-208
• /
• 1999

In the classification of satellite images, the representative of training of classes is very important factor that affects the classification accuracy. Hence, in order to improve the classification accuracy, it is required to optimize pre-classification stage which determines classification parameters rather than to develop classifiers alone. In this study, the normality of training are calculated at the preclassification stage using SPOT XS and LANDSAT TM. A correlation coefficient of multivariate Q-Q plot with 5% significance level and a variance of initial training are considered as an object function of genetic algorithm in the training normalization process. As a result of normalization of training using the genetic algorithm, it was proved that, for the study area, the mean and variance of each class shifted to the population, and the result showed the possibility of prediction of the distribution of each class.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.1
• /
• pp.111-118
• /
• 2015

This paper deals with the routing and wavelength assignment problem (RWAP) that decides the best lightpaths for multiple packet demands for (s,t) in optical communication and assigns the minimum number of wavelengths to given lightpaths. There has been unknown of polynomial-time algorithm to obtain the optimal solution for RWAP. Hence, the RWAP is classified as NP-complete problem and one can obtain the approximate solution in polynomial-time. This paper decides the shortest main and alternate lightpath with same hop count for all (s,t) for given network in advance. When the actual demands of communication for particular multiple packet for (s,t), we decrease the maximum utilized edge into b utilized number using these dual-paths. Then, we put these (s,t) into b-wavelength bins without duplicated edge. This algorithm can be get the optimal solution within O(kn) computational complexity. For two experimental data, the proposed algorithm shows that can be obtain the known optimal solution.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.29 no.11
• /
• pp.868-877
• /
• 2018

In this paper, we propose a new beamforming algorithm for a conformal array antenna based on support vector regression(SVR). While the conventional least squares method(LSM) considers all sample errors, SVR considers errors beyond the given error bound to obtain the optimum weight vector, which has a sparse solution and the advantage of the minimization of the overfitting problem. To verify the performance of the proposed algorithm, we apply SVR to the experimentally measured active element patterns of the conformal array antenna and obtain the weights for beamforming. In addition, we compare the beamforming results of SVR and LSM.