• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.07a
• /
• pp.689-691
• /
• 2023

본 논문에서는 시작 노드와 목적지 노드 까지의 최단경로를 중점으로 가장 인접한 경유지를 선택하고 경유지가 다수일 경우 하모니서치 알고리즘을 통해 최적의 경로를 탐색하는 기법을 제안한다. 본 논문의 기법은 기존의 사용자의 현 위치에서 인접한 경유지를 추천해주는 시스템과 달리 목적지까지의 경로 전체에서 가장 인접한경유지를 선택해준다는 차별점이 있다. 그렇게 선택된 경유지들은 하모니서치 알고리즘을 사용하여 최적의 경로를 제안한다. 본 논문의 기법은 최단경로의 이탈을 최소화한 경유지 선택으로 거리, 시간, 비용적 측면에서 효율적이며 길을 헤매서 생기는 불필요한 지연을 최소화할 수 있다. 자율주행, 비행기, 선박, 드론 등 최적 경로 이탈시 큰 손실을 안기거나 위험한 시스템에 적용시 큰 효과를 거둘 수 있다.

• The KIPS Transactions:PartC
• /
• v.13C no.1 s.104
• /
• pp.11-18
• /
• 2006

In the field of network defense, a lot of researches are directed toward locating the source of network attacks. When an intruder launches attack not from their own computer but from intermediate hosts that they previously compromised, and these intermediate hosts are called stepping-stones. There we two kinds of traceback technologies : IP packet traceback and connection traceback. We focused on connection traceback in this paper This paper classifies process structures of detoured attack type in stepping stone, designs an algorithm for traceback agent, and implements the traceback system based on the agent

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.452-455
• /
• 2015

허니넷이란 공격자에게 인위적으로 침해된 후 공격자의 행동을 관찰할 수 있는 정보보호 체계 중 하나로 사전에 취약한 자원을 준비하여 공격자가 외부에서 접근할 수 있도록 구축하는 것이 일반적이다. 하지만 최근 사이버 공격은 외부에서 발생하기보다는 내부에 좀비PC를 만든 후 내부 경유지로 활용하여 공격하는 것이 추세이다. 따라서 기존 허니넷으로는 내부 경유지를 활용한 공격에 적극적으로 대응할 수 없는 것이 현실이다. '11년 농협 전산망 마비 사태의 경우 유지보수 업체의 PC가 내부 경유지로 활용되어 기업 내부망에 침입한 사례로 공격자는 내부 스캔을 통해 주요 자원을 식별하여 사이버 공격을 수행하였다. 이처럼 내부 경유지를 활용한 공격의 시작점은 내부 스캔단계로 사전에 이를 식별할 수 있다면 많은 피해를 사전에 예방할 수 있을 것이다. 이에 본 논문에서는 내부 스캔공격을 식별할 수 있는 Simple 허니팟을 구현하고 이를 활용한 분산 허니넷을 구축하여 내부공격에 대한 효과적인 대응방안에 대하여 제안하고자 한다.

• International Commerce and Information Review
• /
• v.18 no.3
• /
• pp.47-72
• /
• 2016

The Government of Korea has always focused on developing and maintaining a surplus on the balance of payments as a successful trade policy. The focus should now be on spatial information hiding, revealing patterns in trade activities that enable viewing trade in a more sophisticated manner. This study utilizes trade statistical data such as the United States-South Korea imports and exports from 2003 to 2015 officially released by the two countries. It allows us to analyze and extract the spatial information pertaining to the origin, transit, and destination. First, in the case of export data to the United States, the origin of the trade goods has expanded and decentralized from the metropolitan area. With regard to transit, in 2003, most of the exported goods were shipped by ocean vessels and arrived at the ports on the western coast of the United States. However, trade patterns have changed over the 12-year period and now more of that trade has moved to the southern ports of the United States. In terms of destination, California and Texas were importing goods from South Korea. With the development of the automotive industry in Georgia and Alabama, these two states also imported huge volumes of automobile parts. Second, in case of import data, most imported goods from the United States originated from California and Texas. In this case, 40% of goods were shipped by air freight and arrived at the Incheon-Seoul International Airport; most ocean freight was handled at the Port of Busan. The purpose of this study is to decompose the spatial information from the trade statistics data between Korea and the United States and to depict visualized bilateral trade structure by origin, transit, and destination.

• Proceedings of the Korea Information Assurance Society Conference
• /
• 2004.05a
• /
• pp.233-239
• /
• 2004

In this paper, we describe a defense mechanism to cope with stepping stones attacks in high-speed networks. (Stepping stones Attacker launches attacks not from their own computer but from intermediary hosts that they previously compromised.) We aim at tracing origin hacker system, which attack target system via stepping stones. There are two kind of traceback technology ; IP packet traceback, or connection traceback. We are concerned with connection traceback in this paper. We propose a new host-based traceback. The purpose of this paper is that distinguish between origin hacker system and stepping stones by using process structure of OS(Operating System).

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.19-27
• /
• 2007

We have implemented a WWW homepage which finds an optimal route for users. There already exist many web sites which provide the optimal route when a start and a destination cities are given. However, none of them can find the optimal route when a number of cities to be visited. The problem of finding the optimal route starting at a given start city and visiting through all the given intermediate cities and finally returning to the start city is called Travelling Sales Person(TSP) problem. TSP is a well known exponential time complexity problem. We have implemented an artificial intelligent search algorithm for TSP on our homepage. The main feature of our algorithm is that the destination may not be the same as the start city whereas all of the existing heuristic algorithms for TSP assume that the start and the destination cities are the same. The web page asks a user to select all the cities he or she wants to visit(including start and destination city), then it finds a sequence of the cities such that the user would travel minimum distance if he or she visits the cities in the order of the sequence. This paper presents algorithms used in the homepage.

• KSCI Review
• /
• v.22 no.1
• /
• pp.7-14
• /
• 2014

• Proceedings of the Korea Contents Association Conference
• /
• 2011.05a
• /
• pp.49-50
• /
• 2011

본 논문에서는 출발지부터 목적지까지 가는 도중에 슈퍼, 주유소, 식당 등과 같은 특정 장소를 경유하면서 거리와 서비스 같은 다중 속성을 고려한 최적경로를 탐색 알고리즘을 제안한다. 제안하는 최적경로는 기존 연구와 다르게 거리와 같은 단일 속성만 고려하지 않고, 사용자가 지정하는 가중치를 적용하여 다중 속성을 고려해서 사용자 원하는 경유객체들을 하나씩 포함한다. 기존 알고리즘들은 다중 속성과 사용자의 선호도를 고려한 최적경로를 탐색하는 경우에는 적합하지 않다. 이 문제점을 해결하기 위해서 본 논문에서는 필터링 기법을 이용하여 경유객체를 될 수 없는 객체들을 제거하고 최적경로를 탐색하는 알고리즘을 제안한다. 제안하는 알고리즘의 우수성을 확인하기 위해 다양한 성능평가를 수행한다.

• The Journal of the Korea Contents Association
• /
• v.19 no.12
• /
• pp.164-172
• /
• 2019

In this paper, we implement a wheeled mobile robot that accurately and autonomously finds the optimal route from the starting point to the destination point based on computer vision in a complex indoor environment. We get a number of waypoints from the starting point to get the best route to the target through deep reinforcement learning. However, in the case of autonomous driving, the majority of cases do not reach their destination accurately due to external factors such as surface curvature and foreign objects. Therefore, we propose an algorithm to deepen the waypoints and destinations included in the planned route and then correct the route through the waypoint recognition while driving to reach the planned destination. We built an autonomous wheeled mobile robot controlled by Arduino and equipped with Raspberry Pi and Pycamera and tested the planned route in the indoor environment using the proposed algorithm through real-time linkage with the server in the OSX environment.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.1
• /
• pp.93-103
• /
• 2019

Recently, malicious code distribution of ransomware through a web site based on a drive-by-download attack has resulted in service disruptions to the web site and damage to PC files for end users. Therefore, analyzing the characteristics of the target web site industry, distribution time, application type, and type of malicious code that is being exploited can predict and respond to the attacker's attack activities by analyzing the status and trend of malicious code sites. In this paper, we will examine the distribution of malicious codes to 3.43 million websites in Korea to draw out the characteristics of each detected landing site, exploit site, and distribution site, and discuss countermeasures.