• 대한수학회보
• /
• 제56권2호
• /
• pp.277-283
• /
• 2019

In this paper, we present a cube root algorithm using a recurrence relation. Additionally, we compare the implementations of the Pocklington and $Padr{\acute{o}}-S{\acute{a}}ez$ algorithm with the Adleman-Manders-Miller algorithm. With the recurrence relations, we improve the Pocklington and $Padr{\acute{o}}-S{\acute{a}}ez$ algorithm by using a smaller base for exponentiation. Our method can reduce the average number of ${\mathbb{F}}_q$ multiplications.

• 전기학회논문지P
• /
• 제64권4호
• /
• pp.315-320
• /
• 2015

Proposal algorithm in this paper introduced cells, units of router group, for distributed processing of previous genetic algorithm. This paper presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was verified superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

• 대한전기학회논문지:전력기술부문A
• /
• 제52권1호
• /
• pp.44-49
• /
• 2003

This paper describes a percentage current differential relaying algorithm for bus protection blocked by a CT saturation detection algorithm. The detection algorithm blocks the output of a current differential relay only if a differential current is caused by CT saturation in the case of an external fault. Moreover, if a current differential relay operates faster than the detection algorithm, the blocking signal is not ignited. On the other hand. if the detection algorithm operates faster than a current differential relay, the output of the relay is blocked. The results of the simulation show that the proposed algorithm can discriminate internal faults from external faults ever when a CT is saturated in both cases. This paper concludes by implementing the algorithm into the TMS320C6701 digital signal processor. The results of hardware implementation are also satisfactory The algorithm can not only increase the sensitivity of the current differential relay but Improve the stability of the relay for an external faults.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.56-58
• /
• 2004

In this paper, we propose an adaptive beamforming algorithm for array antenna. The proposed beamforming algorithm is based on EDS (Euclidean Direction Search) algorithm. Generally LMS algorithm has a much slower rate of convergence, but its low computational complexity and robustness make it a representative method of adaptive beamforming. Although the RLS algorithm is known for its fast convergence to the optimal Wiener solution, it still suffers from high computational complexity and poor performance. The proposed EDS algorithm has a rapid convergence better than LMS algorithm, and has a computational more simple complexity than RLS algorithm. In this paper we compared the efficiency of the EDS algorithm with a standard LMS algorithm.

• Journal of Advanced Marine Engineering and Technology
• /
• 제32권1호
• /
• pp.192-199
• /
• 2008

In order for a mobile robot to move under unknown or uncertain environment. it is very important to collect environmental information. This paper suggests a traveling algorithm which leads to the map building algorithm and the $A^*$ algorithm under the assumption that environmental information should already be collected. In order to apply the proposed traveling algorithm to a real mobile robot. this paper additionally discusses a path amendment algorithm. For the purpose of verifying the proposed algorithms, several simulations are executed based on a UI host program-based simulation interface and an experiment is executed using a mobile robot under a real unknown environment.

• 설비공학논문집
• /
• 제16권11호
• /
• pp.1035-1043
• /
• 2004

For a long road tunnel, a tunnel ventilation system may be used in order to reduce the pollution level below the required level. To control the tunnel pollution level, a closed loop control algorithm may be used. The feedforward prediction algorithm and the cascade control algorithm were developed to regulate the CO level in a tunnel. The feedforward prediction algorithm composed of the traffic estimation algorithm and the CO density prediction algorithm, and the cascade control algorithm composed of the jet fan control algorithm and the air velocity setpoint algorithm. The verification of control algorithms was carried out by dynamic models developed from the actual tunnel data. The simulation results showed that control algorithms developed for this study were effective for the control of the tunnel ventilation system.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.255-255
• /
• 2000

Technical advance of electrical chart and cruising equipment make it possible to sail without a man. It is important to decide the cruising route in view of effectiveness and stability of a ship. So we need to study on the optimal trajectory planning. Genetic algorithm is a strong optimization algorithm with adaptational random search. It is a good choice to apply genetic algorithm to the trajectory planning of a ship. We modify a genetic algorithm to solve this problem. The effectiveness of the revised genetic algorithm is assured through computer simulations.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2004년도 추계학술대회
• /
• pp.858-863
• /
• 2004

In the optimized design of an actual structure, the design variable should be selected among any certain values or corresponds to a discrete design variable that needs to handle the size of a pre-formatted part. Various algorithms have been developed for discrete design. As recently reported, the sequential algorithm with orthogonal arrays(SOA), which is a local minimum search algorithm in discrete space, has excellent local minimum search ability. It reduces the number of function evaluation using orthogonal arrays. However it only finds a local minimum and the final solution depends on the initial value. In this research, the genetic algorithm, which defines an initial population with the potential solution in a global space, is adopted in SOA. The new algorithm, sequential algorithm with orthogonal arrays and genetic algorithm(SOAGA), can find a global solution with the properties of genetic algorithm and the solution is found rapidly with the characteristics of SOA.

• 한국게임학회 논문지
• /
• 제17권5호
• /
• pp.123-132
• /
• 2017

경로 탐색 알고리즘은 이동 가능한 에이전트가 게임 내의 가상 월드에서 현재 위치로부터 목적지까지 가는 경로를 탐색하는 알고리즘을 뜻한다. 기존의 경로 탐색 알고리즘은 A*, Dijkstra와 같이 비용기반으로 그래프 탐색을 수행한다. A*와 Dijkstra는 월드 맵에서 이동 가능한 노드와 에지 정보들을 필요로 해서 맵의 정보가 다양하고 많은 온라인 게임에 적용하기 힘들다. 본 논문에서는 가변환경이나 맵의 데이터가 방대한 게임에서 적용 가능한 경로 탐색 알고리즘을 개발하기 위해 맵의 정보 없이 교배, 교차, 돌연변이, 진화 연산을 통해 해를 찾는 유전 알고리즘(Genetic Algorithm, GA)을 활용한 Heuristic-based Genetic Algorithm Path-finding(HGAP)를 제안한다. 제안하는 알고리즘은 Binary-Coded Genetic Algorithm을 기반으로 하며 목적지에 더 빨리 도달하기 위해 목적지로 가는 경로를 추정하는 휴리스틱 연산을 수행하여 경로를 탐색한다.

• 전자공학회논문지S
• /
• 제35S권5호
• /
• pp.48-58
• /
• 1998

In this paper, we proposed a new algorithm using characteristics of th ereconstructed phase trajectory by topological mapping developed for a real-tiem detection of the QRS complexes of ECG signals. Using fill-factor algorithm and mutual information algorithm which are in genral used to find out the chaotic characteristics of sampled signals, we inferred the proper mapping parameter, time delay, in ECG signals and investigated QRS detection rates with varying time delay in QRS complex detection. And we compared experimental time dealy with the theoretical one. As a result, it shows that the experimental time dealy which is proper in topological mapping from ECG signals is 20ms and theoretical time delays of fill-factor algorithm and mutual information algorithm are 20.+-.0.76ms and 28.+-.3.51ms, respectively. From these results, we could easily infer that the fill-factor algorithm in topological mapping from one-dimensional sampled ECG signals to two-dimensional vectors, is a useful algorithm for the detemination of the proper ECG signals to two-dimensional vectors, is a useful algorithm for the detemination of the proper time delay. Also with the proposed algorithm which is very simple and robust to low-frequency noise as like baseline wandering, we could detect QRS complex in real-time by simplifying preprocessing stages. For the evaluation, we implemented the proposed algorithm in C-language and applied the MIT/BIH arrhythmia database of 48 patients. The proposed algorithm provides a good performance, a 99.58% detection rate.