• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.741-753
• /
• 2006

As the total amount of traffic data in network has been growing at an alarming rate, many researches to mine traffic data with the purpose of getting useful information are currently being performed. However, network users' privacy can be compromised during the mining process. In this paper, we propose an efficient and practical privacy preserving sequential pattern mining method on network traffic data. In order to discover frequent sequential patterns without violating privacy, our method uses the N-repository server model and the retention replacement technique. In addition, our method accelerates the overall mining process by maintaining the meta tables so as to quickly determine whether candidate patterns have ever occurred. The various experiments with real network traffic data revealed tile efficiency of the proposed method.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.3D
• /
• pp.263-270
• /
• 2010

This research has reviewed the ways to improve the benefits of shortening of transit hours among the benefit items in analysis of economic efficiency. The existing way of calculating the benefits of shortening the transit hours in analysis of economic efficiency has been using O/D in peak to multiply by 365. This method has a problem of not considering the change of traffic according to the month and the day of the week. To improve such problem, the volume of traffics at 361 regular research branches of the chronological statistics of traffic volume was used to analyze the pattern change of traffic volume per day of the week and per month by t-test and cluster analysis. The results show a difference in traffic volume according to the day of the week and the month. In the research example, a supposed O/D and network were used to apply weight per day of the week and per month to see a slight difference with the existing method of calculating benefits of shortening the transit hours. This signifies the necessity to study about the weight to consider the change pattern of traffic volume.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.1
• /
• pp.1-14
• /
• 2013

Annual average daily traffic (AADT) serves the important basic data in transportation sector. Despite of its importance, AADT is estimated through permanent traffic counts (PTC) at limited locations because of constraints in budget and so on. At most of locations, AADT is estimated using short-term traffic counts (STC). Though many studies have been carried out at home and abroad in an effort to enhance the accuracy of AADT estimate, the method to simplify average STC data has been adopted because of application difficulty. A typical model for estimating AADT is an adjustment factor application model which applies the monthly or weekly adjustment factors at PTC points (or group) with similar traffic pattern. But this model has the limit in determining the PTC points (or group) with similar traffic pattern with STC. Because STC represents usually 24-hour or 48-hour data, it's difficult to forecast a 365-day traffic variation. In order to improve the accuracy of traffic volume prediction, this study used the geostatistical approach called co-kriging and according to their reports. To compare results, using 3 methods : using adjustment factor in same section(method 1), using grouping method to apply adjustment factor(method 2), cokriging model using previous year's traffic data which is in a high spatial correlation with traffic volume data as a secondary variable. This study deals with estimating AADT considering time and space so AADT estimation is more reliable comparing other research.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.4
• /
• pp.44-57
• /
• 2019

Various studies have been conducted to solve traffic congestions in many metropolitan cities through accurate traffic flow prediction. Most studies are based on the assumption that past traffic patterns repeat in the future. Models based on such an assumption fall short in case irregular traffic patterns abruptly occur. Instead, the approaches such as predicting traffic pattern through big data analytics and artificial intelligence have emerged. Specifically, deep learning algorithms such as RNN have been prevalent for tackling the problems of predicting temporal traffic flow as a time series. However, these algorithms do not perform well in terms of long-term prediction. In this paper, we take into account various external factors that may affect the traffic flows. We model the correlation between the multi-dimensional context information with temporal traffic speed pattern using deep neural networks. Our model trained with the traffic data from TOPIS system by Seoul, Korea can predict traffic speed on a specific date with the accuracy reaching nearly 90%. We expect that the accuracy can be improved further by taking into account additional factors such as accidents and constructions for the prediction.

• 한국도로학회:학술대회논문집
• /
• 2011.03a
• /
• pp.269-275
• /
• 2011

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.10a
• /
• pp.272-277
• /
• 2000

The classical queuing analysis has been tremendously useful in doing capacity planning and performance prediction, However, in many real-world cases. it has found that the predicted results form a queuing analysis differ substantially hem the actual observed performance. Specially, in recent years, a number of studies have demonstrated that for some environments, the traffic pattern is self-similar rather than Poisson. In this paper, we study these self-similar traffic characteristics and the definition of self-similar stochastic processes. Then, we consider the examples of self-similar data traffic, which is reported from recent measurement studies. Finally, we wish you that it makes out about the characteristics of actual data traffic more easily.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.437-439
• /
• 2006

Actually, The present traffic accident detection system is subsisting limitation of accurate distinction under the crowded condition at intersection because the system defend upon mainly the image information at intersection and digital image processing techniques nearly all. To complement this insufficiency, this article aims to estimate the level of present technology and a realistic possibility by analyzing the acoustic characteristic of crash sound that we have to investigate for improvement of traffic accident detection rate at intersection. The skid sound of traffic accident is showed the special pattern at 1[kHz])${\sim}$3[kHz] bandwidth when vehicles are almost never operated in and around intersection. Also, the frequency bandwidth of vehicle crash sound is showed sound pressure difference oyer 30[dB] higher than when there is no occurrence of traffic accident below 500[Hz].

• Journal of the Korea Computer Industry Society
• /
• v.3 no.7
• /
• pp.915-920
• /
• 2002

The classical queuing analysis has been tremendously useful in doing capacity planning and performance prediction. However, in many real-world cases. it has found that the predicted results form a queuing analysis differ substantially from the actual observed performance. Specially, in recent years, a number of studies have demonstrated that for some environments, the traffic pattern is self-similar rather than Poisson. In this paper, we study these self-similar traffic characteristics and the definition of self-similar stochastic processes. Then, we consider the examples of self-similar data traffic, which is reported from recent measurement studies. Finally, we wish yon that it makes out about the characteristics of actual data traffic more easily.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.173-178
• /
• 2001

The classical queuing analysis has been tremendously useful in doing capacity planning and performance prediction. However, in many real-world cases. it has found that the predicted results form a queuing analysis differ substantially from the actual observed performance. Specially, in recent years, a number of studies have demonstrated that for some environments, the traffic pattern is self-similar rather than Poisson. In this paper, we study these self-similar traffic characteristics and the definition of self-similar stochastic processes. Then, we consider the examples of self-similar data traffic, which is reported from recent measurement studies. Finally, we wish you that it makes out about the characteristics of actual data traffic more easily.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.7 no.1
• /
• pp.15-23
• /
• 2003

ATM networks provide the various kinds of service which require the different Quality of Services(QoS) such as loss and delay. By statistically multiplexing of traffics and the uncertainty and fluctuation of source traffic pattern, the congestion may occur. The leaky bucket scheme is a representative policing mechanism for preventive congestion control. In this paper, we analyze the HOL(Head-of-Line) priority leaky bucket scheme. That is, traffics are classified into real-time and nonreal-time traffic. The real-time traffic has priority over nonreal-time traffic for transmission. For proposed mechanism, we obtain the system state distribution, finally the loss probability and the mean waiting time of real-time and nonreal-time traffic. The simple numerical examples also are presented.