• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.31 no.1D
• /
• pp.43-50
• /
• 2011

The monitoring system for link travel speed using taxi probe is one of key sub-systems of ITS. Link travel speed collected by taxi probe has been widely employed for both monitoring the traffic states of urban road network and providing real-time travel time information. When sample size of taxi probe is small and link travel time is longer than a length of time interval to collect travel speed data, and in turn the missing state is inevitable. Under this missing state, link travel speed data is real-timely not collected. This missing state changes from single to multiple time intervals. Existing single interval prediction techniques can not generate multiple future states. For this reason, it is necessary to replace multiple missing states with the estimations generated by multi-interval prediction method. In this study, a multi-interval prediction method to generate the speed estimations of single and multiple future time step is introduced overcoming the shortcomings of short-term techniques. The model is developed based on Non-Parametric Regression (NPR), and outperformed single-interval prediction methods in terms of prediction accuracy in spite of multi-interval prediction scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.10
• /
• pp.1330-1336
• /
• 2021

Media sharing platform such as YouTube have grown significantly in the mobile environment. This is a platform that allows users to select and view broadcast programs that are only available on TV through network-connected PCs and mobiles, and share their media content to communicate. Currently, in the era where mobile and TV broadcasts can be viewed equally, there is a time difference between the video and real-time screen transmitted to TV and mobile, different from the actual situation.We want this time difference to be realized in the same way as the real time, and there is a need for a system that can broadcast in a free environment at any time. Therefore, in this paper, a broadcasting system was designed and implemented in a mobile environment. The result of reducing the delay time difference due to the improvement of the processing method was obtained.

• Journal of Korean Society of Transportation
• /
• v.19 no.4
• /
• pp.85-96
• /
• 2001

This paper discusses the problem of finding the Origin-Destination(O-D) shortest path in urban road networks that have variable special qualifies such as time windows for passing as well as geometrical special qualities such as U-turn and left-turn prohibition. The focus of this paper is motivated by the problem of finding minimum travel time paths for an advanced traveler information system (ATIS) in the context of intelligent transportation system(ITS) application. The transportation network with variable and geometrical special qualities is a more realistic representation of the urban road network in the real word. But, the traditional and existing shortest path algorithms can not search practical shortest path that variable special quality is reflected. This paper presents a shortest path algorithm which can search reasonable shortest path information for the urban ATIS application within a real time. The algorithm is based on genetic algorithm(GA). The high performance of the proposed algorithm is demonstrated by computer simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7A
• /
• pp.493-502
• /
• 2003

In this paper, to solve some problems of the Mobile IP and local registration strategy we propose a method that can effectively support real-time traffics sensitive to delay time and packet loss. The proposed method reduces the registration time after a Mobile Node's movement between networks by carrying out the pre-registration for the domain which it will move into the network information of the link layer of cdma2000 system, at the boundary cell's handoff zone. Through the cost analysis and simulation it is shown that the proposed scheme yield a better performance compared with the Mobile IP and local registration strategies in terms of packet loss for parameters; variation of the velocity of a Mobile Node, and a distance between the Mobile Node and home networks, etc.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.3
• /
• pp.11-16
• /
• 2004

Recently, collaborative works are increased more and more over the distributed heterogeneous computing environments. The availability of high-speed wide-area networks has also enabled collaborative multimedia applications such as video conferencing, distributed interactive simulation and collaborative visualization. Distributed high performance computing and collaborative multimedia applications, it is extremely important to efficiently perform group communication over a heterogeneous network. Typical group communication patterns are broadcast and Multicast. Heuristic algorithms such as FEF, ECEF, look-ahead make up the message transmission tree for the broadcast and multicast over the distributed heterogeneous systems. But, there are some shortcomings because these select the optimal solution at each step, it may not be reached to the global optimum In this paper, we propose a new heuristic algerian that constructs tree for efficiently collective communication over the previous heterogeneous communication model which has heterogenity in both node and network. The previous heuristic algorithms my result in a locally optimal solution, so we present more reasonable and available criterion for choosing edge. Through the performance evaluation over the various communication cost, improved heuristic algorithm we proposed have less completion time than previous algorithms have, especially less time complexity than look-ahead approach.

• Journal of KIISE
• /
• v.43 no.7
• /
• pp.801-811
• /
• 2016

Self-adaptive systems (SASs) can change their goals and behaviors to achieve its ultimate goal in a dynamic execution environment. Existing approaches have designed, at the design time, utility functions to evaluate and predict the goal satisfaction, and set policies that are crucial to achieve each goal. The systems can be adapted to various runtime environments by utilizing the pre-defined utility functions and policies. These approaches, however, may or may not guarantee the proper adaptability, because system designers cannot assume and predict all system environment perfectly at the design time. To cope with this problem, this paper proposes a new method of dynamic decision making, which takes the following steps: firstly we design a Dynamic Decision Network (DDN) with environmental data and goal model that reflect system contexts; secondly, the goal satisfaction is evaluated and predicted with the designed DDN and real-time environmental information. We furthermore propose a dynamic reflection method that changes the model by using newly generated data in real-time. The proposed method was actually applied to ROBOCODE, and verified its effectiveness by comparing to conventional static decision making.

• Journal of Advanced Navigation Technology
• /
• v.27 no.5
• /
• pp.674-684
• /
• 2023

In this paper, a real-time prediction technique for gravity disturbances is proposed using a multi-layer perceptron (MLP) model. To select a suitable MLP model, 4 models with different network sizes were designed to compare the training accuracy and execution time. The MLP models were trained using the data of vehicle moving along the surface of the sea or land, including their positions and gravity disturbance. The gravity disturbances were calculated using the 2160^th degree and order EGM2008 with SHM. Among the models, MLP4 demonstrated the highest training accuracy. After training, the weights and biases of the 4 models were stored in the embedded computer of the INS to implement the MLP network. MLP4 was found to have the shortest execution time among the 4 models. These research results are expected to contribute to improving the navigation accuracy of INS through gravity disturbance compensation in the future.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.2
• /
• pp.856-865
• /
• 2012

Maintenance systems are demanded to manage malodor-information and deal effectively with the odor-related civil complaints by constructing the database for sources of malodor compounds in real time. In this paper, to carry out these tasks, a real-time monitering system for malodor based on ubiquitous sensor networks(USN) is presented. The constructed monitering system stores the malodor data collected periodically from industrial complex into the database and shows in real time the circumstances of the odor sources being emitted around the industrial complex by indicating on the map where it is taking place. Besides, by clicking an icon indicating the sensor node on the map, we can figure out what firms are located near the malodor source and possible material related with those firms. The proposed system is considered to enhance the efficiency of management of malodor-emitting firms based on the malodor-related information.

• The Journal of the Korea Contents Association
• /
• v.20 no.6
• /
• pp.556-578
• /
• 2020

There are many different researches about how to analyze issues based on real-time news streams. But, there are few researches which analyze issues hierarchically from news articles and even a previous research of hierarchical issue analysis make clustering speed slower as the increment of news articles. In this paper, we propose a hierarchical and incremental clustering for semi real-time issue analysis on news articles. We trained siamese neural network based weighted cosine similarity model, applied this model to k-means algorithm which is used to make word clusters and converted news articles to document vectors by using these word clusters. Finally, we initialized an issue cluster tree from document vectors, updated this tree whenever news articles happen, and analyzed issues in semi real-time. Through the experiment and evaluation, we showed that up to about 0.26 performance has been improved in terms of NMI. Also, in terms of speed of incremental clustering, we also showed about 10 times faster than before.

• Journal of Digital Contents Society
• /
• v.18 no.6
• /
• pp.1009-1015
• /
• 2017

Recently, video surveillance is becoming more and more common as many camera are installed due to crime, terrorism, traffic and security. And systems that control cameras are becoming increasingly general. Video input from the installed camera is monitored by the multiscreen at the central control center, it is essential to simultaneously monitor multiscreen in real-time to quickly respond to situations or dangers. However, monitoring of multiscreen in a mobile environment such as a smart phone is not applied to hardware specifications or network bandwidth problems. For resolving these problems, in this paper, we propose a system that can monitor multiscreen in real-time in mobile-phone environment. We reconstruct the desired multiscreen through transcoding, it is possible to monitor continuously video streaming of multiple cameras, and to have the advantage of being mobile in mobile-phone environment.