• Title/Summary/Keyword: traffic filtering

Search Result 140, Processing Time 0.03 seconds

A Study of Eliminating the Vehicle Noise of Engine RPM from the Friction Noise between Tire and Road Pavement by Using a NCPX Method (NCPX 계측방법을 이용한 타이어/노면 사이에서 발생하는 마찰소음에 대한 차량자체에서 발생하는 소음 제거 연구)

  • Han, Bong-Koo;Kim, Do Wan;Mun, Sungho;Kim, Ha-Yeon
    • International Journal of Highway Engineering
    • /
    • v.15 no.4
    • /
    • pp.31-42
    • /
    • 2013
  • PURPOSES : The purpose of this study is to eliminate the noise of the vehicle after measuring the friction noise obtained from the NCPX (Noble Close ProXimity) method. The pure friction noise between the tire and road pavement could be determined from filtering the compositeness of sound and the influence of the vehicle noise. METHODS: The noise magnitude could be determined by analyzing the sound pressure level (SPL) and sound power level (PWL) along with the noise frequency of a FFT (Fast Fourier Transform) analysis as well as CPB (Constant Percentage Bandwidth) analysis. RESULTS: When the test for measuring the friction noise originated somewhere between tire and road pavement is performed with NCPX method, it must be fulfilled by attaching the surface microphone near the tire. In this condition, the surface microphone can measure the friction noise occurred at between tire and pavement, the chassis noise from the engine and power transfer units, the fluctuating aerodynamic noise, and the turbulence noise directly affected to the surface microphone. By using the NCPX method, the noise occurred at the vehicle must be eliminated for measuring the friction noise between tire and pavement from the traffic noise. CONCLUSIONS: The vehicle's testing engine noise depends on the vehicle and road types. The effect of vehicle's engine noise is less than the friction noise occurred at between tire and pavement at less than 1% effect.

Design and Implementation of Moving Object Model for Nearest Neighbors Query Processing based on Multi-Level Global Fixed Gird (다단계 그리드 인덱스 기반 최근접 질의 처리를 위한 이동체 DBMS 모델의 설계와 구현)

  • Joo, Yong-Jin
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.19 no.3
    • /
    • pp.13-21
    • /
    • 2011
  • In mobile environment supporting mobility technologies, user requirements have been increased with respect to utilization of location information. In particular, moving object DBMS has consistently posed in order to efficiently maintain traffic information related to location of vehicle which tents to tremendously change over time. Despite the fact that these sorts of researches must be taken into consideration, empirical studies on moving object in terms of map database for lbs service, spatial attribute of which is continuously changed over time, have rarely performed. Therefore, aim of this paper is to suggest efficient spatial index scheme, which is capable of supporting query processing algorithm and location of moving object over time, by developing new empirical model. As a result, we can come to the conclusion that moving object model based on multi-fixed grid index makes it possible to cut down on the number of entity for retrieving. What's more, this model enables hierarchical data to be accessed through efficient spatial filtering on large-scale lbs data and constraints in accordance with level in order to display map.

A Connection Management Protocol for Stateful Inspection Firewalls in Multi-Homed Networks

  • Kim, Jin-Ho;Lee, Hee-Jo;Bahk, Sae-Woong
    • Journal of Communications and Networks
    • /
    • v.10 no.4
    • /
    • pp.455-464
    • /
    • 2008
  • To provide network services consistently under various network failures, enterprise networks increasingly utilize path diversity through multi-homing. As a result, multi-homed non-transit autonomous systems become to surpass single-homed networks in number. In this paper, we address an inevitable problem that occurs when networks with multiple entry points deploy firewalls in their borders. The majority of today's firewalls use stateful inspection that exploits connection state for fine-grained control. However, stateful inspection has a topological restriction such that outgoing and incoming traffic of a connection should pass through a single firewall to execute desired packet filtering operation. Multi-homed networking environments suffer from this restriction and BGP policies provide only coarse control over communication paths. Due to these features and the characteristics of datagram routing, there exists a real possibility of asymmetric routing. This mismatch between the exit and entry firewalls for a connection causes connection establishment failures. In this paper, we formulate this phenomenon into a state-sharing problem among multiple fire walls under asymmetric routing condition. To solve this problem, we propose a stateful inspection protocol that requires very low processing and messaging overhead. Our protocol consists of the following two phases: 1) Generation of a TCP SYN cookie marked with the firewall identification number upon a SYN packet arrival, and 2) state sharing triggered by a SYN/ACK packet arrival in the absence of the trail of its initial SYN packet. We demonstrate that our protocol is scalable, robust, and simple enough to be deployed for high speed networks. It also transparently works under any client-server configurations. Last but not least, we present experimental results through a prototype implementation.

Design and Implementation of Web-based Home PNA Device Management System (웹 기반 Home PNA 장치 관리 시스템의 설계 및 구현)

  • An, Byeong-O;An, Seong-Jin;Jeong, Jin-Uk
    • The KIPS Transactions:PartC
    • /
    • v.8C no.6
    • /
    • pp.865-874
    • /
    • 2001
  • In this paper, we have designed and implemented Web based Home Phoneline Neworking Aliance(Home PNA)device management, system which can resolve the unfair bandwidth service form may subscribers and manage subscribes using these devices. To manage Home PNA device with Simple Network Management Protocol(SNMP) management elements are classified into system. Port performance, fault functional area based on Management Information Base(MIB) objects from Multi Dwelling Unit(MDU) devices MIB. System management provides configuration information of each MDU devices, and port management provides the current state of subscribes and performs filtering operation against the unauthorized users. And performance management provides traffic information about trunk and subscriber lines. Finally fault management provides fault logging fo the unexpected events and trap message from devices To verify the operability of the proposed system, we have tested it in real network environment.

  • PDF

Development of Travel Time Estimation Algorithm for National Highway by using Self-Organizing Neural Networks (자기조직형 신경망 이론을 이용한 국도 통행시간 추정 알고리즘)

  • Do, Myungsik;Bae, Hyunesook
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.28 no.3D
    • /
    • pp.307-315
    • /
    • 2008
  • The aim of this study is to develop travel time estimation model by using Self-Organized Neural network(in brief, SON) algorithm. Travel time data based on vehicles equipped with GPS and number-plate matching collected from National road number 3 (between Jangji-IC and Gonjiam-IC), which is pilot section of National Highway Traffic Management System were employed. We found that the accuracies of travel time are related to location of detector, the length of road section and land-use properties. In this paper, we try to develop travel time estimation using SON to remedy defects of existing neural network method, which could not additional learning and efficient structure modification. Furthermore, we knew that the estimation accuracy of travel time is superior to optimum located detectors than based on existing located detectors. We can expect the results of this study will make use of location allocation of detectors in highway.

A Store Recommendation Procedure in Ubiquitous Market for User Privacy (U-마켓에서의 사용자 정보보호를 위한 매장 추천방법)

  • Kim, Jae-Kyeong;Chae, Kyung-Hee;Gu, Ja-Chul
    • Asia pacific journal of information systems
    • /
    • v.18 no.3
    • /
    • pp.123-145
    • /
    • 2008
  • Recently, as the information communication technology develops, the discussion regarding the ubiquitous environment is occurring in diverse perspectives. Ubiquitous environment is an environment that could transfer data through networks regardless of the physical space, virtual space, time or location. In order to realize the ubiquitous environment, the Pervasive Sensing technology that enables the recognition of users' data without the border between physical and virtual space is required. In addition, the latest and diversified technologies such as Context-Awareness technology are necessary to construct the context around the user by sharing the data accessed through the Pervasive Sensing technology and linkage technology that is to prevent information loss through the wired, wireless networking and database. Especially, Pervasive Sensing technology is taken as an essential technology that enables user oriented services by recognizing the needs of the users even before the users inquire. There are lots of characteristics of ubiquitous environment through the technologies mentioned above such as ubiquity, abundance of data, mutuality, high information density, individualization and customization. Among them, information density directs the accessible amount and quality of the information and it is stored in bulk with ensured quality through Pervasive Sensing technology. Using this, in the companies, the personalized contents(or information) providing became possible for a target customer. Most of all, there are an increasing number of researches with respect to recommender systems that provide what customers need even when the customers do not explicitly ask something for their needs. Recommender systems are well renowned for its affirmative effect that enlarges the selling opportunities and reduces the searching cost of customers since it finds and provides information according to the customers' traits and preference in advance, in a commerce environment. Recommender systems have proved its usability through several methodologies and experiments conducted upon many different fields from the mid-1990s. Most of the researches related with the recommender systems until now take the products or information of internet or mobile context as its object, but there is not enough research concerned with recommending adequate store to customers in a ubiquitous environment. It is possible to track customers' behaviors in a ubiquitous environment, the same way it is implemented in an online market space even when customers are purchasing in an offline marketplace. Unlike existing internet space, in ubiquitous environment, the interest toward the stores is increasing that provides information according to the traffic line of the customers. In other words, the same product can be purchased in several different stores and the preferred store can be different from the customers by personal preference such as traffic line between stores, location, atmosphere, quality, and price. Krulwich(1997) has developed Lifestyle Finder which recommends a product and a store by using the demographical information and purchasing information generated in the internet commerce. Also, Fano(1998) has created a Shopper's Eye which is an information proving system. The information regarding the closest store from the customers' present location is shown when the customer has sent a to-buy list, Sadeh(2003) developed MyCampus that recommends appropriate information and a store in accordance with the schedule saved in a customers' mobile. Moreover, Keegan and O'Hare(2004) came up with EasiShop that provides the suitable tore information including price, after service, and accessibility after analyzing the to-buy list and the current location of customers. However, Krulwich(1997) does not indicate the characteristics of physical space based on the online commerce context and Keegan and O'Hare(2004) only provides information about store related to a product, while Fano(1998) does not fully consider the relationship between the preference toward the stores and the store itself. The most recent research by Sedah(2003), experimented on campus by suggesting recommender systems that reflect situation and preference information besides the characteristics of the physical space. Yet, there is a potential problem since the researches are based on location and preference information of customers which is connected to the invasion of privacy. The primary beginning point of controversy is an invasion of privacy and individual information in a ubiquitous environment according to researches conducted by Al-Muhtadi(2002), Beresford and Stajano(2003), and Ren(2006). Additionally, individuals want to be left anonymous to protect their own personal information, mentioned in Srivastava(2000). Therefore, in this paper, we suggest a methodology to recommend stores in U-market on the basis of ubiquitous environment not using personal information in order to protect individual information and privacy. The main idea behind our suggested methodology is based on Feature Matrices model (FM model, Shahabi and Banaei-Kashani, 2003) that uses clusters of customers' similar transaction data, which is similar to the Collaborative Filtering. However unlike Collaborative Filtering, this methodology overcomes the problems of personal information and privacy since it is not aware of the customer, exactly who they are, The methodology is compared with single trait model(vector model) such as visitor logs, while looking at the actual improvements of the recommendation when the context information is used. It is not easy to find real U-market data, so we experimented with factual data from a real department store with context information. The recommendation procedure of U-market proposed in this paper is divided into four major phases. First phase is collecting and preprocessing data for analysis of shopping patterns of customers. The traits of shopping patterns are expressed as feature matrices of N dimension. On second phase, the similar shopping patterns are grouped into clusters and the representative pattern of each cluster is derived. The distance between shopping patterns is calculated by Projected Pure Euclidean Distance (Shahabi and Banaei-Kashani, 2003). Third phase finds a representative pattern that is similar to a target customer, and at the same time, the shopping information of the customer is traced and saved dynamically. Fourth, the next store is recommended based on the physical distance between stores of representative patterns and the present location of target customer. In this research, we have evaluated the accuracy of recommendation method based on a factual data derived from a department store. There are technological difficulties of tracking on a real-time basis so we extracted purchasing related information and we added on context information on each transaction. As a result, recommendation based on FM model that applies purchasing and context information is more stable and accurate compared to that of vector model. Additionally, we could find more precise recommendation result as more shopping information is accumulated. Realistically, because of the limitation of ubiquitous environment realization, we were not able to reflect on all different kinds of context but more explicit analysis is expected to be attainable in the future after practical system is embodied.

Energy-Performance Efficient 2-Level Data Cache Architecture for Embedded System (내장형 시스템을 위한 에너지-성능 측면에서 효율적인 2-레벨 데이터 캐쉬 구조의 설계)

  • Lee, Jong-Min;Kim, Soon-Tae
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.5
    • /
    • pp.292-303
    • /
    • 2010
  • On-chip cache memories play an important role in both performance and energy consumption points of view in resource-constrained embedded systems by filtering many off-chip memory accesses. We propose a 2-level data cache architecture with a low energy-delay product tailored for the embedded systems. The L1 data cache is small and direct-mapped, and employs a write-through policy. In contrast, the L2 data cache is set-associative and adopts a write-back policy. Consequently, the L1 data cache is accessed in one cycle and is able to provide high cache bandwidth while the L2 data cache is effective in reducing global miss rate. To reduce the penalty of high miss rate caused by the small L1 cache and power consumption of address generation, we propose an ECP(Early Cache hit Predictor) scheme. The ECP predicts if the L1 cache has the requested data using both fast address generation and L1 cache hit prediction. To reduce high energy cost of accessing the L2 data cache due to heavy write-through traffic from the write buffer laid between the two cache levels, we propose a one-way write scheme. From our simulation-based experiments using a cycle-accurate simulator and embedded benchmarks, the proposed 2-level data cache architecture shows average 3.6% and 50% improvements in overall system performance and the data cache energy consumption.

Real-Time Vehicle License Plate Recognition System Using Adaptive Heuristic Segmentation Algorithm (적응 휴리스틱 분할 알고리즘을 이용한 실시간 차량 번호판 인식 시스템)

  • Jin, Moon Yong;Park, Jong Bin;Lee, Dong Suk;Park, Dong Sun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.9
    • /
    • pp.361-368
    • /
    • 2014
  • The LPR(License plate recognition) system has been developed to efficient control for complex traffic environment and currently be used in many places. However, because of light, noise, background changes, environmental changes, damaged plate, it only works limited environment, so it is difficult to use in real-time. This paper presents a heuristic segmentation algorithm for robust to noise and illumination changes and introduce a real-time license plate recognition system using it. In first step, We detect the plate utilized Haar-like feature and Adaboost. This method is possible to rapid detection used integral image and cascade structure. Second step, we determine the type of license plate with adaptive histogram equalization, bilateral filtering for denoise and segment accurate character based on adaptive threshold, pixel projection and associated with the prior knowledge. The last step is character recognition that used histogram of oriented gradients (HOG) and multi-layer perceptron(MLP) for number recognition and support vector machine(SVM) for number and Korean character classifier respectively. The experimental results show license plate detection rate of 94.29%, license plate false alarm rate of 2.94%. In character segmentation method, character hit rate is 97.23% and character false alarm rate is 1.37%. And in character recognition, the average character recognition rate is 98.38%. Total average running time in our proposed method is 140ms. It is possible to be real-time system with efficiency and robustness.

Development of an AIDA(Automatic Incident Detection Algorithm) for Uninterrupted Flow Based on the Concept of Short-term Displaced Flow (연속류도로 단기 적체 교통량 개념 기반 돌발상황 자동감지 알고리즘 개발)

  • Lee, Kyu-Soon;Shin, Chi-Hyun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.15 no.2
    • /
    • pp.13-23
    • /
    • 2016
  • Many traffic centers are highly hesitant in employing existing Automatic Incident Detection Algorithms due to high false alarm rate, low detection rate, and enormous effort taken in maintaining algorithm parameters, together with complex algorithm structure and filtering/smoothing process. Concerns grow over the situation particularly in Freeway Incident Management Area This study proposes a new algorithm and introduces a novel concept, the Displaced Flow Index (DiFI) which is similar to a product of relative speed and relative occupancy for every execution period. The algorithm structure is very simple, also easy to understand with minimum parameters, and could use raw data without any additional pre-processing. To evaluate the performance of the DiFI algorithm, validation test on the algorithm has been conducted using detector data taken from Naebu Expressway in Seoul and following transferability tests with Gyeongbu Expressway detector data. Performance test has utilized many indices such as DR, FAR, MTTD (Mean Time To Detect), CR (Classification Rate), CI (Composite Index) and PI (Performance Index). It was found that the DR is up to 100%, the MTTD is a little over 1.0 minutes, and the FAR is as low as 2.99%. This newly designed algorithm seems promising and outperformed SAO and most popular AIDAs such as APID and DELOS, and showed the best performance in every category.

Characteristics of Particulate Matter 2.5 by Type of Space of Urban Park - Focusing on the Songsanghyeon Plaza in Busan - (도로변 공원의 공간조성유형에 따른 초미세먼지 분포 특성 - 부산시 송상현광장을 사례로-)

  • Ahn, Rosa;Hong, Sukhwan
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.49 no.6
    • /
    • pp.37-48
    • /
    • 2021
  • Roadside pollution has been identified as the main cause of PM2.5 in urban areas. Green infrastructure has been understood to mitigate air pollution from roadside traffic effectively, but complication depend on environmental variables. This study aimed to investigate the characteristic of PM2.5 by the type of space in an urban park located in Songsanghyeon Plaza, surrounded by a 12-lane road on all sides. Type of space was typically classified as roadside square (A), sunken square (B), a mix of trees and hedges/shrubs (C), trees only (D), and grass square (E) according to the land-use type and layers of trees. PM2.5 was measured for nine days, three days for three different Air Quality Forecasts-Good level (0~15㎍/m3), Moderate level (16~35㎍/m3), and Unhealthy level (36~75㎍/m3). The analysis result was as follows. At good levels, there was statistical significance in the order of D, E < B, C < A. In the case of moderate levels and unhealthy levels, D and E were statistically lower than other land-use types. The characteristic of PM2.5 in the urban park by type of space was affected by atmospheric flow into the road. The relatively high concentration of A and C was located near the roads. Although B was far away from the road, the reason for the high concentration of PM2.5 was that no structures blocked the air pollution. Thanks to the type of space C, filtering the air pollution from the roads, the concentration of PM2.5 in D and E was relatively low.