• Journal of Positioning, Navigation, and Timing
• /
• v.13 no.2
• /
• pp.137-147
• /
• 2024

This paper presents a novel Long Short-Term Memory (LSTM) network architecture for the integration of an Inertial Measurement Unit (IMU) and Global Navigation Satellite Systems (GNSS). The proposed algorithm consists of two independent LSTM networks and the LSTM networks are trained to predict attitudes and velocities from the sequence of IMU measurements and mechanization solutions. In this paper, three GNSS receivers are used to provide Real Time Kinematic (RTK) GNSS attitude and position information of a vehicle, and the information is used as a target output while training the network. The performance of the proposed method was evaluated with both experimental and simulation data using a lowcost IMU and three RTK-GNSS receivers. The test results showed that the proposed LSTM network could improve positioning accuracy by more than 90% compared to the position solutions obtained using a conventional Kalman filter based IMU/GNSS integration for more than 30 seconds of GNSS outages.

• Journal of Internet Computing and Services
• /
• v.10 no.1
• /
• pp.19-31
• /
• 2009

Network management involves configuring and operating various network elements in a suitable manner. Generally, a network management system can perform basic functionalities such as configuration management, performance management, and fault management. Due to the open structure of the Internet, the volume of network traffic and the network equipment used have increased in size and complexity. Therefore, it is expensive and time consuming to develop a network management program for heterogeneous network equipment in an SNMP.based network. In order to facilitate the management of network environments and the control of heterogeneous devices in an efficient manner, we propose an Active Network Management System (ANMS) comprising an automatic generator that uses triggers to generate a network management program. The concept of triggers can be represented through event condition action rules performed in response to a change in the status of a network environment. The proposed ANMS comprises basic components for real time network management and also includes an automatic generator (AG). When the ANMS is monitoring network elements that are newly added or changed, a trigger rule is activated and these components are then able to collaborate and automatically generate a new network management program by using the information provided along with the SNMP libraries. Our method is useful for expanding the network structure and replacing network equipment. Through experiments, we have proved that our ANMS is useful when new network objects are added or changed in the network environment to expand the network structure. Further, we have verified that our ANMS system reduces the time and cost required to develop a network management program as compared to the manual method used in existing network management systems.

• Journal of Korean Society of Transportation
• /
• v.22 no.4 s.75
• /
• pp.135-146
• /
• 2004

For improving the effectiveness of travel information, some rational paths are needed to provide them to users driving in real road network. To meet it, k-shortest path algorithms have been used in general. Although the k-shortest path algorithm can provide several alternative paths, it has inherent limit of heavy overlapping among derived paths, which nay lead to incorrect travel information to the users. In case of considering the network consisting of several turn prohibitions popularly adopted in real world network, it makes difficult for the traditional network optimization technique to deal with. Banned and penalized turns are not described appropriately for in the standard node/link method of network definition with intersections represented by nodes only. Such problem could be solved by expansion technique adding extra links and nodes to the network for describing turn penalties, but this method could not apply to large networks as well as dynamic case due to its overwhelming additional works. This paper proposes a link-based shortest path algorithm for the travel information in real road network where exists turn prohibitions. It enables to provide efficient alternative paths under consideration of overlaps among paths. The algorithm builds each path based on the degree of overlapping between each path and stops building new path when the degree of overlapping ratio exceeds its criterion. Because proposed algorithm builds the shortest path based on the link-end cost instead or node cost and constructs path between origin and destination by link connection, the network expansion does not require. Thus it is possible to save the time or network modification and of computer running. Some numerical examples are used for test of the model proposed in the paper.

• Journal of the Economic Geographical Society of Korea
• /
• v.11 no.3
• /
• pp.459-475
• /
• 2008

This study analyzes the network structure of the Metropolitan Seoul subway system by applying complex network analysis methods. For the purpose, we construct the Metropolitan Seoul subway system as a network graph, and then calculate various indices introduced in complex network analysis. Structural characteristics of Metropolitan Seoul subway network are discussed by these indices. In particular, this study determines the shortest paths between nodes based on the weighted distance (physical and time distance) as well as topological network distance, since urban travel movements are more sensitive for them. We introduce an accessibility measurement based on the shortest distance both in terms of physical distance and network distance, and then compare the spatial structure between two. Accessibility levels of the system have been getting up overall, and thus the accessibility gaps have been getting lessen between center located subway stops and remote ones during the last 10 years. Passenger traffic volumes are explored from real passenger transaction databases by utilizing data mining techniques, and mapped by GIS. Clear differences reveal between the spatial patterns of real passenger flows and accessibility. That is, passenger flows of the Metropolitan Seoul subway system are related with population distribution and land use around subway stops as well as the accessibility supported by the subway network.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2609-2614
• /
• 1998

In this work, we consider the forecasting performance between nearal network and Box-Jenkins method for time series data. A modified learning process is developed for neural network approach at time eries data, ie, properly adaptive learning rates selecting by orthogonal arrays and dynamic selecting of initial values using Easton's cotroller box. We can obtain good starting points with dynamic graphics approach. We use real data sets for this study : the Wolf yearly sunspot numbers between 1700 and 1988.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12B
• /
• pp.1037-1041
• /
• 2004

In this paper we propose a new conceptual slave clock system in which remotely located clock is synchronized to the reference clock by intermediation of the satellite time, show a probability of adoption to real network by experiments. This new proposed method has lots of structural advantages over the existing methods because all of the node clocks can be maintained with the same hierarchical quality. The measurement results show that the accuracy of the experimental slave clock system can be kept within a few parts in 1012 and that the MTIE (Maximum Time Interval Error) meets the ITU-T Recommendation G.811 for the primary reference clock A prototype system having fully automatic operational functions has been realized, and it is expected to be commercially used as a node clock for synchronization in the digital communication network in the near future.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1997.06a
• /
• pp.75-81
• /
• 1997

A new DTPP (Desk-Top Program Production) system has been developed that enables multiple program producers (directors) working at different locations to collaborate over a computer network and prepare a single program for broadcasting. In this system, information is shared among users by exchanging data edited on non-linear editing terminals in program post-production work over a network in real time. In short, the new DTPP system provides a collaborative work space for producing TV programs. The system does not make use of a special server for collaborative work but rather multiple interconnected editing terminals having the same functions. In this configuration, data at a terminal which has just been edited by some operation is forwarded to all other connected terminals for updating. This form of information sharing, however, requires that some sort of data synchronizing method be established since multiple terminals are operating on the same data simultaneously. We therefore adopt a method whereby the system synchronizes the clocks on each terminal at the time of connection and sends an operation time stamp together with edited data. This enables most recently modified data to be identified and all information on all terminals to be updated appropriately. This paper provides an overview of this new collaborative DTPP system and describes the techniques for exchanging edited data and synchronizing data.

• Journal of Korea Multimedia Society
• /
• v.13 no.1
• /
• pp.38-46
• /
• 2010

A stable game managing system is absolutely needed to accept simultaneous interlacing of many users for on- line game system. The proposed P2P on-line game system in this paper is able to get stable and real-time game managing within limited time stamp utilizing through reorganizing peers according to synchronous time which can be avoid congestion on one region, it is possible to synchronize for game nodes within limited time stamp utilizing. Reorganizing M-tree which leads 10 distribute loads. The system manages each region unit, and it is execute no matter how big game sizes are. Thus to ensure such as the problems of expand server and stabilization or message transmission. Also, prove efficiency of the suggested system through the simulation.

• Journal of IKEEE
• /
• v.22 no.1
• /
• pp.136-142
• /
• 2018

Recently, as the development system has become larger, sequential simulation methods have become impossible to verify systems that take a long time or require real time results. Therefore, a study of a distributed simulation system that simulates several processes has been conducted. In order to simulate real-time systems, efficient data exchange between distributed systems is required. Data Distribution Service is a data-oriented communication middleware proposed by Object Management Group and provides efficient data exchange and various QoS. However, in a large-scale distributed simulation environment distributed over a wide area, there is a problem of Participant Discovery and QoS guarantee due to domain separation in data exchange. Therefore, in this paper, we propose a DDS/SDN architecture that can guaranteed QoS and effective Participant Discovery in an SDN-based network.

• Journal of Korea Multimedia Society
• /
• v.2 no.3
• /
• pp.339-346
• /
• 1999

When a multicast video conference system utilizes RTP (Real Time Protocol) and RTCP (Real Time Control Protocol), the loss rate and the synchronization of transfer in RTCP affect the scalability of the system. The random delay technique introduced to resolve the problems is so simple that leads the network to meet some congestion in synchronizing feedback information when lots of people transfer the feedback information simultaneously, which reduces the scalability of system. In this paper, we propose a new feedback control algorithm that provides priority levels with the RTCP packet, which cuts down the feedback delay and increases the scalability. The criteria of providing priority Based on the decided priority level, Agent forced the session participants to provide much more RTCP packets, positively controlled, and the possible bandwidth can be measured. The simulation on this technique decreases the delay, and the feedback messages are equally distributed on a given time period.