• Journal of the Korea Society of Computer and Information
• /
• v.28 no.5
• /
• pp.9-15
• /
• 2023

In this paper, we propose a method predicting the speed of each lane from the link speed using a neural network. We took three measures for configuring learning data to increase prediction accuracy. The first one is to expand the spatial range of the data source by including 14 links connected to the beginning and end points of the link. We also increased the time interval from 07:00 to 22:00 and included the data generation time in the feature data. Finally, we marked weekdays and holidays. Results of experiments showed that the speed error was reduced by 21.9% from 6.4 km/h to 5.0 km/h for straight lane, by 12.9% from 8.5 km/h to 7.4 km/h for right turns, and by 5.7% from 8.7 km/h to 8.2 km/h for left-turns. As a secondary result, we confirmed that the prediction accuracy of each lane was high for city roads when the traffic flow was congested. The feature of the proposed method is that it predicts traffic conditions for each lane improving the accuracy of prediction.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.12
• /
• pp.1207-1215
• /
• 2013

This paper proposes the location estimation techniques of distributed targets with the multi-sensor data perceived through IR sensors of the military robots in consideration of obstacles. In order to match up targets with measured azimuths, to add to the depth-first search (DFS) algorithms in free-obstacle environment, we suggest the expanded DFS (EDS) algorithm including bypass path search, partial path search, middle level ending, and the supplementation of decision metric. After matching up targets with azimuths, we estimate the coordinate of each target by obtaining the intersection point of the azimuths with the least square error (LSE) algorithm. The experimental results show the error rate of estimated location, mean number of calculating nodes, and mean distance between real coordinates and estimated coordinates of the proposed algorithms.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.9
• /
• pp.795-802
• /
• 2002

We present a new dynamic routing scheme for multiple autonomous guided vehicles (AGVs) systems. There have been so many results concerned with scheduling and routing of multiple AGV systems; however, most of them are only applicable to systems with a small number of AGVs under a low degree of concurrency. With an increased number of AGVs in recent applications, these AGV systems are faced with another problem that has never been occurred in a system with a small number AGVs. This is the stop propagation problem. That is, if a leading AGV stops then all the following AGVs must stop to avoid any collision. In order to resolve this problem, we propose a nonstop preferential detour (NPD) algorithm which is a new dynamic routing scheme employing an election algorithm. For real time computation, we introduce two stage control scheme and propose a new path searching scheme, k-via shortest path scheme for an efficient dynamic routing algorithm. Finally, the proposed new dynamic routing scheme is illustrated by an example.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.1737_1738
• /
• 2009

미사일의 표적 충돌각을 원하는 각도로 제어하는 것은 표적의 취약점을 공략하기 위해 필수적인 기술이다. 표적 타격 지점 및 충돌각을 고려하지 않으면 타격에 성공하였다고 하더라도 표적의 방어 능력이 좋거나 신관이 충돌각에 민감하면 표적의 효과적인 파괴에 실패할 수도 있다. 이런 경우 유도 미사일의 종말 유도 효율을 증가시키기 위해 미사일이 표적을 타격하는 각도인 표적 충돌각(Impact Angle)을 제어할 수 있으면 적정 비행경로의 설정에 유리하고 우회공격 등이 가능할 뿐 아니라 미사일 탄두의 효과를 극대화할 수 있다. 하지만 이러한 장점을 갖는 표적 충돌각 유도 기법에 대한 연구는 아직 활발하게 행해지고 있지는 못하다. 기존 연구 결과들은 2차원 평면상에서의 충돌각 제어만을 다루고 있어, 요와 피치 채널의 커플링 문제가 있는 BTT 미사일에 적용하기가 어렵다는 문제점을 갖고 있다. 또한 미사일 동역학을 무시하거나 단순화하여 문제를 풀고 있기 때문에 실제 상황에 적용이 어렵다는 단점이 있다. 본 논문에서는 3차원 공간상에서의 롤 명령을 모두 포함하면서 동시에 미사일 자동조종제어기, 핀 구동기 동역학을 모두 고려한 새로운 BTT 미사일의 표적 충돌각 유도 기법을 제안한다.

• Journal of Chest Surgery
• /
• v.42 no.1
• /
• pp.111-114
• /
• 2009

Aorto-iliac artery aneurysms are very rare and the natural course of this disease is not well known. However, the risk of rupture is high and the mortality rate after rupture is extremely high. Preserving the pelvic circulation is important for the treatment of aorto-iliac artery aneurysms. We report here on a case of a patient suffering with aorto-iliac artery aneurysms, and these were treated by a hybrid endovascular operation that combined an open bypass of both iliac vessels with endovascular repair.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06a
• /
• pp.164-165
• /
• 2008

전장에서 임무 수행중인 병력이나 탱크 등을 지원하거나 보호 동물의 활동을 모니터링 하는 센서 네트워크에서는 전송 정보뿐만 아니라 그러한 대상들의 위치를 악의적 추적자로부터 보호할 수 있어야 한다. 본 논문에서는 활동 소오스 노드처럼 메시지 전송은 진행하고 있지 않지만 위치가 보호되어야 할 대상과 근접한 휴면(dormant) 소오스 노드들을 고려한 소오스 위치 보호 라우팅 기법 GSLP(GPSR-based Source-Location Privacy)를 제안한다. GSLP는 알고리즘의 간결성과 신장성(scalability)이 뛰어난 GPSR(greedy perimeter stateless routing)을 확장하여 메시지 전달 노드를 선정할 때 일정 확률로 임의의 이웃 노드를 선택하는 한편, perimeter 라우팅을 적용하여 소오스 노드들을 우회하도록 하여 위치를 보호하도록 하였다. 시뮬레이션 결과, 기존의 대표적인 소오스 위치 보호 라우팅 프로토콜인 PR-SP(Phantom Routing-Single Path)에 비해 GSLP는 휴면 소오스 노드들의 수에 거의 관계없이 높은 안전 기간(전송 메시지 수)을 일정하게 제공하면서도 전달 지연(경로의 평균 홉(hop) 수)은 도착지와의 최단 홉 수의 약 두 배 이내에 머물러 대규모 센서 네트워크에서의 소오스의 위치를 보호하기 위한 방안으로 적합한 것으로 평가되었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.5
• /
• pp.452-459
• /
• 1992

In this paper, we have estimated voice traffics using Kalman-filtering for upcoming years and evaluated performance of a grid topology circuit switched network using above outcomes. Since measurement errors and modeling errors are considered in Kalman-filtering, the system is estimated more accurately than by using any other estimation methods. A grid topology circuit switched network has alternative routing paths, therefore it is more reliable than any other networks. In this paper, we have calculated the call blocking probabilities, which is the key measuremens of performance evaluation in circuit switched networks. by using estimated voice traffics for upcoming years.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.624-629
• /
• 2008

Many routing protocols have been proposed for sensor networks where energy awareness and reliability are essential design issues. This paper proposes an Energy-aware Tree Routing Protocol (ETRP) for Wireless Sensor Networks. The proposed scheme relates to reliable and energy efficient data routing by selecting a data transmission path in consideration of residual energy at each node to disperse energy consumption across the networks and reliably transmit the data through a detour path when there is link or node failure. Simulation results show that the proposed method outperformed traditional Tree Routing (TR) by 23.5% in network lifetime.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.3
• /
• pp.531-539
• /
• 2017

CAPTCHA is a verification scheme whether or not a human user has made a service request. Most CAPTCHAs that are based on text, image, or simple game suffer from vulnerability that can be compromised by automated attacks and stream relay attacks. To resist such attacks, CAPTCHA that utilizes human recognition as been suggested but it show poor usability for deploying in the Internet. We propose an Emerging Image Cue CAPTCHA that offers improved usability and resists stream relay attacks, as well. We also examine the usability of the proposed CAPTCHA and investigate the attack resistance by conducting user study and experiments on simulated network environment.

• Journal of the Institute of Convergence Signal Processing
• /
• v.1 no.2
• /
• pp.160-168
• /
• 2000

In this paper, we study how the remote controllable mobile robot which could come to many via points with FLC(Fuzzy Logic Control) efficiently. The fabricated robot stop after the movement of single path method by four kinds of commands (forward, backward, turn left, turn right). To reduce disadvantages of this driving type, this paper reduce via points to goal position base on map which get from senor, let robot drive via point to via point on optimized path. An algorithm for the avoidance of unexpected obstacles by FLC is developed. And these algorithms are confirmed by computer simulations