• Title/Summary/Keyword: Bottleneck Detection

Search Result 39, Processing Time 0.03 seconds

Study and Evaluation of an Incident Detection Algorithm for Urban Freeways (도시고속도로 돌발상황 감지 알고리즘 개발에 관한 연구 및 평가)

  • Seo Jeong-ho;In Sung-man;Kim Young-chan
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.3 no.1 s.4
    • /
    • pp.53-65
    • /
    • 2004
  • A series of accidents, which are non-recurrent and non-anticipated, are called incidents. These incidents make standard traffic flows interrupt, which result in the decrease of road capacity and a number of social and economic costs, such as the traffic congestion and air pollution. In order to prevent the hazard of incidents, domestic and foreign traffic management center are likely to opt auto-sense system with algorithms of auto-incident sense. However, it is evaluated that the algorithms have a low function with frequent wrong alarms, even if they accurately ry to speculate the incidents. In the case of bottleneck which has lack of road capacity, compared with other roads, due to inefficient road structured over-capacity of the demand of on-off ramp, the incidents regularly take place. Nonetheless, it can be more difficult to speculate the auto-incidents sense owing to similar incidents, such as the queue of in-out flows of cars and the change of road line. Throughout this research, the function of the model has improved excluding near road line in the module of the incidents which is based on the auto-incidents algorithms during the sense of the congestion of ramp areas.

  • PDF

EPfuzzer: Improving Hybrid Fuzzing with Hardest-to-reach Branch Prioritization

  • Wang, Yunchao;Wu, Zehui;Wei, Qiang;Wang, Qingxian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.9
    • /
    • pp.3885-3906
    • /
    • 2020
  • Hybrid fuzzing which combines fuzzing and concolic execution, has proved its ability to achieve higher code coverage and therefore find more bugs. However, current hybrid fuzzers usually suffer from inefficiency and poor scalability when applied to complex, real-world program testing. We observed that the performance bottleneck is the inefficient cooperation between the fuzzer and concolic executor and the slow symbolic emulation. In this paper, we propose a novel solution named EPfuzzer to improve hybrid fuzzing. EPfuzzer implements two key ideas: 1) only the hardest-to-reach branch will be prioritized for concolic execution to avoid generating uninteresting inputs; and 2) only input bytes relevant to the target branch to be flipped will be symbolized to reduce the overhead of the symbolic emulation. With these optimizations, EPfuzzer can be efficiently targeted to the hardest-to-reach branch. We evaluated EPfuzzer with three sets of programs: five real-world applications and two popular benchmarks (LAVA-M and the Google Fuzzer Test Suite). The evaluation results showed that EPfuzzer was much more efficient and scalable than the state-of-the-art concolic execution engine (QSYM). EPfuzzer was able to find more bugs and achieve better code coverage. In addition, we discovered seven previously unknown security bugs in five real-world programs and reported them to the vendors.

Parallel Processing Architecture for Parity Checksum Generator Complying with ITU-T J.83 ANNEX B (ITU-T J.83 ANNEX B의 Parity Checksum Generator를 위한 병렬 처리 구조)

  • Lee, Jong-Yeop;Hong, Eon-Pyo;Har, Dong-Soo;Lim, Hai-Jeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.6C
    • /
    • pp.619-625
    • /
    • 2009
  • This paper proposes a parallel architecture of a Parity Checksum Generator adopted for packet synchronization and error detection in the ITU-T Recommendation J.83 Annex B. The proposed parallel processing architecture removes a performance bottleneck occurred in a conventional serial processing architecture, leading to significant decrease in processing time for generating a Parity Checksum. The implementation results show that the proposed parallel processing architecture reduces the processing time by 83.1% at the expense of 16% area increase.

Methodology for Real-time Detection of Changes in Dynamic Traffic Flow Using Turning Point Analysis (Turning Point Analysis를 이용한 실시간 교통량 변화 검지 방법론 개발)

  • KIM, Hyungjoo;JANG, Kitae;KWON, Oh Hoon
    • Journal of Korean Society of Transportation
    • /
    • v.34 no.3
    • /
    • pp.278-290
    • /
    • 2016
  • Maximum traffic flow rate is an important performance measure of operational status in transport networks, and has been considered as a key parameter for transportation operation since a bottleneck in congestion decreases maximum traffic flow rate. Although previous studies for traffic flow analysis have been widely conducted, a detection method for changes in dynamic traffic flow has been still veiled. This paper explores the dynamic traffic flow detection that can be utilized for various traffic operational strategies. Turning point analysis (TPA), as a statistical method, is applied to detect the changes in traffic flow rate. In TPA, Bayesian approach is employed and vehicle arrival is assumed to follow Poisson distribution. To examine the performance of the TPA method, traffic flow data from Jayuro urban expressway were obtained and applied. We propose a novel methodology to detect turning points of dynamic traffic flow in real time using TPA. The results showed that the turning points identified in real-time detected the changes in traffic flow rate. We expect that the proposed methodology has wide application in traffic operation systems such as ramp-metering and variable lane control.

Cascade CNN with CPU-FPGA Architecture for Real-time Face Detection (실시간 얼굴 검출을 위한 Cascade CNN의 CPU-FPGA 구조 연구)

  • Nam, Kwang-Min;Jeong, Yong-Jin
    • Journal of IKEEE
    • /
    • v.21 no.4
    • /
    • pp.388-396
    • /
    • 2017
  • Since there are many variables such as various poses, illuminations and occlusions in a face detection problem, a high performance detection system is required. Although CNN is excellent in image classification, CNN operatioin requires high-performance hardware resources. But low cost low power environments are essential for small and mobile systems. So in this paper, the CPU-FPGA integrated system is designed based on 3-stage cascade CNN architecture using small size FPGA. Adaptive Region of Interest (ROI) is applied to reduce the number of CNN operations using face information of the previous frame. We use a Field Programmable Gate Array(FPGA) to accelerate the CNN computations. The accelerator reads multiple featuremap at once on the FPGA and performs a Multiply-Accumulate (MAC) operation in parallel for convolution operation. The system is implemented on Altera Cyclone V FPGA in which ARM Cortex A-9 and on-chip SRAM are embedded. The system runs at 30FPS with HD resolution input images. The CPU-FPGA integrated system showed 8.5 times of the power efficiency compared to systems using CPU only.

Prism-based Mesh Culling Method for Effective Continuous Collision Detection (효율적인 연속 충돌감지를 위한 프리즘 기반의 메쉬 컬링 기법)

  • Woo, Byung-Kwang;You, Hyo-Sun;Choi, Yoo-Joo
    • Journal of the Korea Computer Graphics Society
    • /
    • v.15 no.4
    • /
    • pp.1-11
    • /
    • 2009
  • In this paper, we present a prism-based mesh culling method to improve effectiveness of continuous collision detection which is a major bottleneck in a simulation using polygonal mesh models. A prism is defined based on two matching triangles between a sequence of times m a polygonal model. In order to detect potential colliding set(PCS) of prism between two polygonal models in a unit time, we apply the visibility test based on the occlusion query to two sets of prisms which are defined from two polygonal models in a unit time. Moreover, we execute the narrow band culling based on SAT(Separating Axis Test) to define potential colliding prism pairs from PCS of prisms extracted as a result of the visibility test. In the SAT, we examine one axis to be perpendicular to a plane which divides a 3D space into two half spaces to include each prism. In the experiments, we applied the proposed culling method to pairs of polygonal models with the different size and compared the number of potential colliding prism pairs with the number of all possible prism pairs of two polygonal models. We also compared effectiveness and performance of the visibility test-based method with those of the SAT-based method as the second narrow band culling. In an experiment using two models to consist of 2916 and 2731 polygons, respectively, we got potential colliding prism pairs with 99 % of culling rate.

  • PDF

PARKING GUIDE AND MANAGEMENT SYSTEM WITH RFID AND WIRELESS SENSOR NETWORK

  • Gue Hun Kim;Seung Yong Lee;Joong Hyun Choi;Youngmi Kwon
    • International conference on construction engineering and project management
    • /
    • 2009.05a
    • /
    • pp.1278-1282
    • /
    • 2009
  • In apartment type of housing, if resident's vehicle is registered in central control office and RFID TAG is issued, identification can be recognized from the time of entrance into parking lot and intelligent parking guide system can be activated based on the residents' profile. Parking Guide System leads a vehicle to the available parking space which is closest to the entrance gate of the vehicle's owner. And when residents forget where they parked their cars, they can query to the Parking Guide and Management System and get responses about the location. For the correct operation of this system, it is necessary to find out where the residents' cars have parked in real time and which lot is available for parking of other cars. RFID is very fancy solution for this system. RFID reader gathers the ID information in RFID TAGs in parked cars and updates the DB up to date. But, when non-residents' cars are parked inside apartment, RFID reader cannot identify them nor know the exact empty/occupied status of parking spaces because they don't react to RFID reader's query. So for the exact detection of empty/occupied status, we suggest the combined use of ultrasonic sensors and RFID. We designed a tree topology with intermediate data aggregators. The depth of tree is normally more than 3 from root (central office) to leaves (individual parking lots). The depth of 2 in tree topology brings about the bottleneck in communication and maintenance. We also designed the information fields used in RFID networks and Sensor Networks.

  • PDF

A Study of Anomaly Detection for ICT Infrastructure using Conditional Multimodal Autoencoder (ICT 인프라 이상탐지를 위한 조건부 멀티모달 오토인코더에 관한 연구)

  • Shin, Byungjin;Lee, Jonghoon;Han, Sangjin;Park, Choong-Shik
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.3
    • /
    • pp.57-73
    • /
    • 2021
  • Maintenance and prevention of failure through anomaly detection of ICT infrastructure is becoming important. System monitoring data is multidimensional time series data. When we deal with multidimensional time series data, we have difficulty in considering both characteristics of multidimensional data and characteristics of time series data. When dealing with multidimensional data, correlation between variables should be considered. Existing methods such as probability and linear base, distance base, etc. are degraded due to limitations called the curse of dimensions. In addition, time series data is preprocessed by applying sliding window technique and time series decomposition for self-correlation analysis. These techniques are the cause of increasing the dimension of data, so it is necessary to supplement them. The anomaly detection field is an old research field, and statistical methods and regression analysis were used in the early days. Currently, there are active studies to apply machine learning and artificial neural network technology to this field. Statistically based methods are difficult to apply when data is non-homogeneous, and do not detect local outliers well. The regression analysis method compares the predictive value and the actual value after learning the regression formula based on the parametric statistics and it detects abnormality. Anomaly detection using regression analysis has the disadvantage that the performance is lowered when the model is not solid and the noise or outliers of the data are included. There is a restriction that learning data with noise or outliers should be used. The autoencoder using artificial neural networks is learned to output as similar as possible to input data. It has many advantages compared to existing probability and linear model, cluster analysis, and map learning. It can be applied to data that does not satisfy probability distribution or linear assumption. In addition, it is possible to learn non-mapping without label data for teaching. However, there is a limitation of local outlier identification of multidimensional data in anomaly detection, and there is a problem that the dimension of data is greatly increased due to the characteristics of time series data. In this study, we propose a CMAE (Conditional Multimodal Autoencoder) that enhances the performance of anomaly detection by considering local outliers and time series characteristics. First, we applied Multimodal Autoencoder (MAE) to improve the limitations of local outlier identification of multidimensional data. Multimodals are commonly used to learn different types of inputs, such as voice and image. The different modal shares the bottleneck effect of Autoencoder and it learns correlation. In addition, CAE (Conditional Autoencoder) was used to learn the characteristics of time series data effectively without increasing the dimension of data. In general, conditional input mainly uses category variables, but in this study, time was used as a condition to learn periodicity. The CMAE model proposed in this paper was verified by comparing with the Unimodal Autoencoder (UAE) and Multi-modal Autoencoder (MAE). The restoration performance of Autoencoder for 41 variables was confirmed in the proposed model and the comparison model. The restoration performance is different by variables, and the restoration is normally well operated because the loss value is small for Memory, Disk, and Network modals in all three Autoencoder models. The process modal did not show a significant difference in all three models, and the CPU modal showed excellent performance in CMAE. ROC curve was prepared for the evaluation of anomaly detection performance in the proposed model and the comparison model, and AUC, accuracy, precision, recall, and F1-score were compared. In all indicators, the performance was shown in the order of CMAE, MAE, and AE. Especially, the reproduction rate was 0.9828 for CMAE, which can be confirmed to detect almost most of the abnormalities. The accuracy of the model was also improved and 87.12%, and the F1-score was 0.8883, which is considered to be suitable for anomaly detection. In practical aspect, the proposed model has an additional advantage in addition to performance improvement. The use of techniques such as time series decomposition and sliding windows has the disadvantage of managing unnecessary procedures; and their dimensional increase can cause a decrease in the computational speed in inference.The proposed model has characteristics that are easy to apply to practical tasks such as inference speed and model management.

Comparison of Sampling Techniques for Passive Internet Measurement: An Inspection using An Empirical Study (수동적 인터넷 측정을 위한 샘플링 기법 비교: 사례 연구를 통한 검증)

  • Kim, Jung-Hyun;Won, You-Jip;Ahn, Soo-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.6
    • /
    • pp.34-51
    • /
    • 2008
  • Today, the Internet is a part of our life. For that reason, we regard revealing characteristics of Internet traffic as an important research theme. However, Internet traffic cannot be easily manipulated because it usually occupy huge capacity. This problem is a serious obstacle to analyze Internet traffic. Many researchers use various sampling techniques to reduce capacity of Internet traffic. In this paper, we compare several famous sampling techniques, and propose efficient sampling scheme. We chose some sampling techniques such as Systematic Sampling, Simple Random Sampling and Stratified Sampling with some sampling intensities such as 1/10, 1/100 and 1/1000. Our observation focused on Traffic Volume, Entropy Analysis and Packet Size Analysis. Both the simple random sampling and the count-based systematic sampling is proper to general case. On the other hand, time-based systematic sampling exhibits relatively bad results. The stratified sampling on Transport Layer Protocols, e.g.. TCP, UDP and so on, shows superior results. Our analysis results suggest that efficient sampling techniques satisfactorily maintain variation of traffic stream according to time change. The entropy analysis endures various sampling techniques well and fits detecting anomalous traffic. We found that a traffic volume diminishment caused by bottleneck could induce wrong results on the entropy analysis. We discovered that Packet Size Distribution perfectly tolerate any packet sampling techniques and intensities.