• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.3
• /
• pp.87-97
• /
• 2018

The traffic accident reports that are generated by the Traffic Broadcasting Networks(TBN) are unstructured data. It, however, has the value as some sort of real-time traffic information generated by the viewpoint of the drives and/or pedestrians that were on the roads, the time and spots, not the offender or the victim who caused the traffic accidents. However, the traffic accident reports, which are big data, were not applied to traffic accident analysis and traffic related research commonly. This study adopting text-mining technique was able to provide a clue for utilizing it for the impacts of traffic accidents. Seven years of traffic reports were grasped by this analysis. By analyzing the reports, it was possible to identify the road names, accident spot names, time, and to identify factors that have the greatest influence on other drivers due to traffic accidents. Authors plan to combine unstructured accident data with traffic reports for further study.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.163-165
• /
• 2006

The subway passengers are usually alert to the current location of the train in order not to miss the destination or transfer stations. The Global Positioning System (GPS), although expensive, can give an alarm if properly programmed, but cannot receive the satellite signals, underground. Therefore, a novel approach to context-aware location-based subway information system is motivated. The passengers, who are equipped with mobile devices such as laptop, PDA, and mobile phone as clients of the Personal Area Network (PAN), request the Bluetooth connection to the server which is installed in each car of the train. While the sorrel broadcasts the location-based information including the previous station, the current velocity of the train, the distance and time to the next station, the clients provide additional services based on the recognized context of the information, and what the passengers individually want. The services are spontaneous and autonomous rather than passive. The services include not only the information on the nearby stations, exit numbers, connection buses but also the location-based alarms which can be set specific to various personal requests, and sounded by the location of the train rather than time. Whereas the arrival time may not be accurate due to the delays of the train, the location can be accurately traced and broadcast by the server. Also, the clients do not need any expensive systems like GFS. Towards validating the proposed approach, we implemented a Bluetooth PAN including a PC server, two PDA clients and a laptop client. We modeled a train on the Incheon Subway Line #1 and a train on the Seoul-to-Incheon Line on the server, simulated the virtual trains together with the real clients. and verified that all the services were successfully provided.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.689-700
• /
• 2007

Organizations and customers lose if business activities we discontinued by an incident of information systems under the current business environment because they pursue real time enterprise and on demand enterprise. The loss includes the intangible decline in brand image, customer separation, and the tangible loss such as decrease in business profits. Thus. it is necessary to have preparedness in advance and mitigation for minimization of a loss due to the business discontinuity and information system's operational risks. This paper suggests the mitigation model for minimizing the incidents of disk unit in information system's operational risks. The model will be represented by a network model which is composed of the three items as following: (1) causes, attributes, indicators of an operational risk, (2) a periodic time through an analysis of historical data, (3) an index or a regulation related to the examination of causes of an operational risk.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.157-165
• /
• 2004

The paper suggests that web-server security management system will be able to detect the web service attack accurately and swiftly which is keeping on increasing at the moment and reduce the possibility of the false positive detection. This system gathers the results of many unit security modules at the real time and enhances the correctness of the detection through the correlation analysis procedure. The unit security module consists of Network based Intrusion Detection System module. File Integrity Check module. System Log Analysis module, and Web Log Analysis and there is the Correlation Analysis module that analyzes the correlations on the spot as a result of each unit security module processing. The suggested system provides the feasible framework of the range extension of correlation analysis and the addition of unit security module, as well as the correctness of the attack detection. In addition, the attack detection system module among the suggested systems has the faster detection time by means of restructuring Snort with multi thread base system. WSM will be improved through shortening the processing time of many unit security modules with heavy traffic.

• Proceedings of the Korean Environmental Sciences Society Conference
• /
• 2003.11a
• /
• pp.73-78
• /
• 2003

In this research, we implement Realtime Air Diffusion Prediction System which is a parallel Fortran model running on distributed-memory parallel computers. The system is designed for air diffusion simulations with four-dimensional data assimilation. For regional air quality forecasting a series of dynamic downscaling technique is adopted using the NCAR/Penn. State MM5 model which is an atmospheric model. The realtime initial data have been provided daily from the KMA (Korean Meteorological Administration) global spectral model output. It takes huge resources of computation to get 24 hour air quality forecast with this four step dynamic downscaling (27km, 9km, 3km, and lkm). Parallel implementation of the realtime system is imperative to achieve increased throughput since the realtime system have to be performed which correct timing behavior and the sequential code requires a large amount of CPU time for typical simulations. The parallel system uses MPI (Message Passing Interface), a standard library to support high-level routines for message passing. We validate the parallel model by comparing it with the sequential model. For realtime running, we implement a cluster computer which is a distributed-memory parallel computer that links high-performance PCs with high-speed interconnection networks. We use 32 2-CPU nodes and a Myrinet network for the cluster. Since cluster computers more cost effective than conventional distributed parallel computers, we can build a dedicated realtime computer. The system also includes web based Gill (Graphic User Interface) for convenient system management and performance monitoring so that end-users can restart the system easily when the system faults. Performance of the parallel model is analyzed by comparing its execution time with the sequential model, and by calculating communication overhead and load imbalance, which are common problems in parallel processing. Performance analysis is carried out on our cluster which has 32 2-CPU nodes.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.355-364
• /
• 2005

With fast advances in computing power and network technologies, online streaming services of continuous media (CM) have been popularly implemented on the Web. To implement such services, a variety of CM streams need to be processed efficiently, so that the Sweep scheme was proposed. This scheme has several advantages such as hiccup-free playbacks and seek-time optimization. In this scheme, however, the entire CM streams are scheduled with a single scheduling period, called a cycle. Since only one scheduling period is allowed in this scheme, a significant amount of disk time is usually wasted because of its inflexible disk schedules. To solve this, we propose a new dynamic Sweep scheme. For this, we devise an algorithm that is able to expand scheduling periods of serviced CM streams and propose a new admission control mechanism guaranteeing hiccup-free playbacks. To show performance gains, we execute various simulation experiments. From the experimental results, we can see that the proposed scheme outperforms the Sweep scheme in terms of disk utilization and scheduling flexibility.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.110-122
• /
• 2005

Bluetooth has been reputed as a wireless networking technology supplying ad-hoc networks between digital devices. In particular, bluetooth scatternet is a most essential part for dynamic ad-hoc networks. But past researches on bluetooth scatternet has hardly treated dynamic scatternet environment. In this paper, we proposed a scatternet reformation algorithm for the case that some nodes escape from the scatternet. The proposed algorithm is a general algorithm which can be applied to many types of bluetooth scatternet regardless of the topology. The proposed algorithm has short reformation time delay because the process has only page process (not including inquiry process ). The algorithm is operated based on Recovery Node Vector which is composed of Recovery Master and Recovery Slave. In this paper, we performed the real hardware experiments for evaluating the performance of the proposed algorithm. In that experiments, we measured the reformation time and reformation probability. In comparison with the case including inquiry process, the proposed algorithm had the improvement in reformation time delay and we obtained high success rate over 97%.

• The KIPS Transactions:PartD
• /
• v.13D no.6 s.109
• /
• pp.755-764
• /
• 2006

In recent, data streams are generated in various application fields such as a ubiquitous computing and a sensor network, and various algorithms are actively proposed for processing data streams efficiently. They mainly focus on the restriction of their memory usage and minimization of their processing time per data element. However, in the algorithms, if data elements of a data stream are generated in a rapid rate for a time unit, some of the data elements cannot be processed in real time. Therefore, an efficient load shedding technique is required to process data streams effcientlv. For this purpose, a load shedding technique over a data stream is proposed in this paper, which is based on the predicting technique of the frequency of data element considering its current frequency. In the proposed technique, considering the change of the data stream, its threshold for tuple alive is controlled adaptively. It can help to prevent unnecessary load shedding.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.1057-1069
• /
• 2017

The applications of Wireless Sensor Networks (WSN) are progressively adopting for various smart home services such as home automation, controlling smart home household appliances, constrained application services in a smart home, etc. However, enabling a seamless and ubiquitous WSN communication between the smart home appliances is still a challenging job. Therefore, in this paper, we propose a smart home control system using an Actuator based ZigBee networking (AZNET). The working of the proposed system is further divided into three phases, 1) an interference avoidance system is adopted to mitigate the effect of interference caused due to the co-existence of IEEE 802.11x based wireless local area networks (WLAN) and WSN, 2) a sensor-based smart light control system is used to fulfill the light requirement in the smart home using the sunlight with light source, and 3) an autonomous home management system is used to regulate the usage time of the electronic appliances in the smart home. The smart is tested in real time environment to use the sunlight with light sources in a various time of the day. Similarly, the performance of the proposed smart home is verified through simulation using C# programming language. The results and analysis revealed that the proposed smart home is less affected by the interference and efficient in reducing the energy consumption of the appliances available in the smart home scenario.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.30 no.5
• /
• pp.425-433
• /
• 2012

Dijkstra's algorithm is one of well-known methods to find shortest paths over a network. However, more research on $A^*$ algorithm is necessary to discover the shortest route to a goal point with the heuristic information rather than Dijkstra's algorithm which aims to find a path considering only the shortest distance to any point for an optimal path search. Therefore, in this paper, we compared Dijkstra's algorithm and $A^*$ algorithm for bicycle route selection. For this purpose, the horizontal distance according to slope angle and average speed were calculated based on factors which influence bicycle route selection. And bicycle routes were selected considering the shortest distance or time-dependent shortest path using Dijkstra's or $A^*$ algorithm. The result indicated that the $A^*$ algorithm performs faster than Dijkstra's algorithm on processing time in large study areas. For the future, optimal path selection algorithm can be used for bicycle route plan or a real-time mobile services.