• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2001.11a
• /
• pp.262-265
• /
• 2001

분산 시스템에서 사용자가 시스템에 로그인 상태에서 자신의 시스템에 존재하지 않는 자원을 이용하기 위한 방안으로 권한위임이 필수적이다. 이러한 권한위임은 다양하게 요구되는 정보보호 응용 서비스의 가용성을 증대시킨다. 본 논문에서는 권한위임을 처리하기 위해서 권한위임 인증서를 생성하여 안전하게 인증서를 중개자에게 전달해야한다. 개시자와 중개자 최종 목적지까지 다단계 권한위임이 발생하는 연결고리에서 PKI 기반 X.509의 공개키를 이용한 효율적이고 추적 및 검증이 가능한 프로토콜을 제안한다.

• Proceedings of the Korean DIstribution Association Conference
• /
• 1997.07a
• /
• pp.81-100
• /
• 1997

현재 국내의 유통업계 전반에 걸친 대변혁은 유통업에 참여하고 기업뿐만 아니라 가치전달기능의 최종 목적지인 소비자, 유통정책을 수립하고 추진하는 정부, 유통체제의 일원인 제조업체 등 관련 이익집단에 유통 기능을 수행하는 마케팅에 대한 새로운 이해의 필요성을 강조하고 있다. 여기서 말하는 새로운 이채란 각 기업과 연관하여 파악된 마케팅 활동의 범주를 넘어 다수의 마케팅 연관 기관의 유기적 교류로 이루어진 마케팅 시스템과 사회의 연관 관계에 대한 이해로 정의 할 수 있을 것이다.(중략)

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.283-286
• /
• 2012

국가과학기술지식정보서비스(NTIS)는 국가 R&D와 관련된 과제, 성과, 인력, 시설 장비, 기술산업 정보에 대해 이용자에게 통합검색서비스를 제공한다. 이용자는 질의어를 입력하여 원하는 정보를 선별하게 되고, 한 건의 상세 메타정보 및 원문을 검색서비스의 최종 목적지로 삼는다. 이 때 이용 중인 정보와 유사한 다른 유형의 R&D 정보를 함께 제공한다면 이용자의 검색 및 탐색노력을 줄임으로써 정보획득의 요구를 쉽게 충족시킬 수 있다. 본 논문에서는 국가 R&D 정보의 메타데이터와 검색엔진의 부스팅 기법을 이용하여 이종 정보간 유사문서 검색 방법에 대해 논한다. 이는 이용자가 원하는 정보를 서비스 최종 화면(메타 상세보기)에서 제공함으로써 검색 서비스의 효율성을 증대시킨다.

• Journal of KIISE:Information Networking
• /
• v.36 no.3
• /
• pp.251-255
• /
• 2009

Network coding is a promising technology that increases the system throughput via reducing the number of transmission for a packet delivered from the source node to the destination node. Nevertheless, it suffers from the metrics of end-to-end delay. Network Coding scheme takes more processing delay which occurs as coding node encodes (XOR) a certain number of packets that relayed by the coding node, and more queuing delay which occurs as a packet waits for other packets to be encoded with. Therefore, in this paper, we analyze the dependency of the queuing delay to the arrival rate of each packet. In addition, we analyze and compare the delay in DCF without XOR and DCF with XOR under dynamic traffic.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.449-452
• /
• 2007

An intelligent robot with RSSI based indoor location estimation function was designed and implemented. A wireless sensor node was attached to the robot to received the location data from the indoor location estimation function. Spartan III was used as the main control device in the mobile robot. The current location data collected from the indoor location estimation system was transferred to the mobile robot and server through Zigbee/IEEE 802.15.4 wireless communication of the sensor node. Once the location data is received, the sensor node senses the direction of the robot head and directs the robot to move to its destination. Indoor location estimation intelligent robot is able to move efficiently and actively to the user appointed location by implementing the proposed obstacles avoidance algorithm. This system is able to monitor real-time environmental data and location of the robot using PC program. Indoor location estimation intelligent robot also can be controlled by executing the instructions sent from the PC program.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.3
• /
• pp.243-249
• /
• 2020

With the development of the 4th Industry Revolution and the progress of related technologies, people have been using various services in a more convenient way in their daily lives. Among these technologies, the smart mobility is a service that effectively transports people or packets from the origin to the final destination using a variety of methods/vehicles. With respect to the smart mobility technology, the shuttle service is operational at the final destination. The conventional shuttle operation only takes into account the shuttle operability and does not consider the shuttle-passenger efficiency at all by the one-way routing. Therefore, in this paper, we propose the smart shuttle algorithm that can change the routes to efficiently support boarding passengers. Our proposed scheme consists of 3 algorithms: the shuttle operating algorithm, the re-routable shuttle traveling algorithm, and the passenger-riding algorithm. All those 3 algorithms are effectively co-operated and collaborated for better performance. In-depth experiments were conducted to analyze and to show the superior performance, resulting in an average 23.6% reduction of destination-arrival time per passenger, average 10.37% reduction of shuttle-waiting time per passenger, and average 15.38% decrease of shuttle traveling time per hour. This proves that our smart shuttle traveling scheme reveals the whole remarkable performance, effectively using the re-routable characteristics.

• 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.

• The Korean Journal of Air & Space Law and Policy
• /
• v.33 no.2
• /
• pp.267-290
• /
• 2018

This paper reviews and criticizes the EU Case of C-452/13, Germanwings GmbH v. Ronny Henning. Under this case, Ronny Henning later sued Lufthansa's budget carrier Germanwings after it refused to pay him 250 euros compensation for a delay he said totalled more than three hours. Germanwings, however, maintained his flight had arrived only two hours and 58 minutes behind schedule. In those circumstances, the following question to the European Court of Justice (ECJ) for a preliminary ruling: What time is relevant for the term time of arrival used in Articles 2, 5 and 7 of Regulation [No 261/2004]: (a) the time that the aircraft lands on the runway (touchdown); (b) the time that the aircraft reaches its parking position and the parking brakes are engaged or the chocks have been applied (in-block time); (c) the time that the aircraft door is opened; (d) a time defined by the parties in the context of party autonomy? ECJ says that the situation of passengers on a flight does not change substantially when their aircraft touches down on the runway at the destination airport, when that aircraft reaches its parking position and the parking brakes are engaged or when the chocks are applied, as the passengers continue to be subject, in the enclosed space in which they are sitting, to various constraints. Therefore, it is only when the passengers are permitted to leave the aircraft and the order is given to that effect to open the doors of the aircraft that the passengers may in principle resume their normal activities without being subject to those constraints. ECJ rules that it is apparent that Articles 2, 5 and 7 of Regulation No 261/2004 must be interpreted as meaning that the concept of 'arrival time', which is used to determine the length of the delay to which passengers on a flight have been subject, corresponds to the time at which at least one of the doors of the aircraft is opened, the assumption being that, at that moment, the passengers are permitted to leave the aircraft.

• Journal of Korean Society of Transportation
• /
• v.23 no.2
• /
• pp.51-60
• /
• 2005

Rail-road intermodal freight transport is a transoortation system that rail and road transport are utilized between origins and destinations. The roles of road(truck) in rail-road intermodal freight transport are pick-up and delivery that are keys parts of total transportation process. The objective of this study is to develop and evaluate the pick-up and delivery strategies for container trucks in order to increase their productivity. Two different strategies are developed : One is aimed for minimizing the total traveling distance of container and the other is to reduce the waiting time at client site. The comparative studies are performed on the actual network of Paris metropolitan. The simulation analysis shows that the proposed strategies are quite efficient in various performance measures.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.05a
• /
• pp.696-698
• /
• 2022

게임에서는 장애물이 가로 막고 있을 때 길 찾기 알고리즘이 요구된다. Path Finding Method 는 길과 장애물을 고려하여 목적지까지의 경로를 찾는 방법을 말한다. A^* 알고리즘은 이런 복잡한 미로 찾기에 최적화된 Path Finding 알고리즘이다. 하지만, 모바일 같은 저비용 기기에서 A^* 알고리즘을 사용하기엔 단순한 지형에서도 연산 부하가 발생할 수 있다. 본 논문에서는 가상의 공간에서 Grid를 구축하여, 통행이 가능한 곳과 불가능한 곳을 나누어 최종 지점에 도달할 수 있도록 하는 방식을 제안한다. 본 논문에서 제시한 Path Finding Method 는 최종 지점이 막다른 길인 경우 가장 가까운 이동 가능한 경로로 길을 안내하도록 설계하여 예외 상황에 대처했다. 대표적인 길 찾기 알고리즘인 Dijkstra 알고리즘은 최소 비용을 고려해서 최단으로 가는 거리를 비교하여 길을 나타낼 수 있다. 하지만, Dijkstra 알고리즘 경우 비용이 양수가 아닌 음수의 경우 무한 루프에 빠지는 등 결과 값이 제대로 나오지 않을 수 있다. 본 논문에서 제안한 Path Finding Method 는 최소 비용을 노드별로 비교하는 방식이 아닌 초기 비용을 알 수 없는 분야에 쉽게 사용할 수 있다. 본 논문에서는 제안한 Path Finding Method 를 적용하여 Web 게임을 제작하는 것에 성공하였다. 향후, Path Finding Method 결과에 위치 정렬 알고리즘을 적용하여, 중복된 지역을 가는 확률을 최소화하면서 정리된 Path 가 돌출되도록 연구할 예정이다. 본 논문의 Path Finding Method 은 게임 개발 분야에 적극 기여되길 바란다.