• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.319-326
• /
• 2004

To help network intrusion detection systems(NIDSs) keep up with the demands of today's networks, that we the increasing network throughput and amount of attacks, a radical new approach in hardware and software system architecture is required. In this paper, we propose a Network Processor(NP) based In-Line mode NIDS that supports the packet payload inspection detecting the malicious behaviors, as well as the packet filtering and the traffic metering. In particular, we separate the filtering and metering functions from the deep packet inspection function using two-level searching scheme, thus the complicated and time-consuming operation of the deep packet inspection function does not hinder or flop the basic operations of the In-line mode system. From a proto-type NP-based NIDS implemented at a PC platform with an x86 processor running Linux, two Gigabit Ethernet ports, and 2.5Gbps Agere PayloadPlus(APP) NP solution, the experiment results show that our proposed scheme can reliably filter and meter the full traffic of two gigabit ports at the first level even though it can inspect the packet payload up to 320 Mbps in real-time at the second level, which can be compared to the performance of general-purpose processor based Inspection. However, the simulation results show that the deep packet searching is also possible up to 2Gbps in wire speed when we adopt 10Gbps APP solution.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2007.05a
• /
• pp.774-779
• /
• 2007

IDF 곡선은 전통적으로 지점에서의 과거 관측 강우량 시계열 자료를 수집하여 작성하여 왔으며, 이때 과거 강우량 자료는 정상성을 지니고 있고 미래를 대변한다는 가정을 전제로 한다. 그러나 이미 많은 연구자들에 의해 기후변화가 전구적으로 발생하고 있으며 우리나라에서도 더 이상 기후변화의 사실여부는 이제 더이상 논란 꺼리가 아니다. 특히, 기후변화의 영향을 직접적으로 받을 수밖에 없는 수자원 분야에서는 1990년대부터 잦은 홍수와 가뭄의 반복으로 곤란을 겪고 있다. 특히, 우리나라는 협소한 국토면적과 과다한 인구로 토지나 수자원 등 국토자원 이용의 강도가 다른 나라에 비하여 현저하게 높기 때문에 지구온난화에 따른 기후변화와 같은 약간의 기후변동으로도 심각한 문제가 발생할 가능성이 내포되어 있다. 특히, 기후변화는 유역 규모의 강우 발생 패턴과 강우량의 증가 및 감소에 영향을 미치게 되며 이로 인해 강우 시계열 자료는 비정상성과 경향성을 지니게 된다. 그러나 지금까지는 IDF 곡선의 작성시 강우의 경향성을 무시해 왔다. 본 연구에서는 기후변화가 IDF 곡선에 미치는 영향을 분석하기 위하여 GCM 기후변화 시나리오를 이용하여 IDF 곡선을 작성하였다. 이를 위하여 먼저, YONU CGCM의 제한실험과 점증실험을 실시하여 전구적 규모의 기후변화 시나리오를 작성하였으며, 통계학적 축소기법과 추계학적 일기발생기법을 이용하여 대상지점의 일 수문기상 시계열을 모의하였다. 그리고 BLRP(Bartlett Lewis Rectangular Pulse) 모형과 분해(koutsoyiannis, 2000) 기법을 이용하여 모의된 일 강우 자료를 시자료로 분해하였으며 이를 이용하여 IDF 곡선을 작성하였다. 그 결과, 기후변화 시 지속기간별 재현기간별 강우량이 현재에 크게 비해 증가됨을 확인할 수 있었다.으며 여러명이 동시에 서버에 접속을 하기 때문에 컴퓨터에 부하가 많이 걸리는 모델링이나 복잡한 분석은 실시하기 어려우며, 대용량 데이터를 전송할 수 있는 대역폭이 확보 되어야 한다. 또한, Internet 환경으로 개발을 해야되기 때문에 데스크탑용 GIS에 비해 개발속도가 느리며 개발 초기비용이 많이 들게 된다. 하지만, 네트워크 기술의 발달과 모바일과의 연계 등으로 이러한 약점을 극복할 수 있을 것으로 판단된다. 따라서 본 논문에서는 인터넷 GIS를 이용하여 홍수재해 정보를 검색, 처리, 분석, 예경보할 수 있는 홍수방재정보 시스템을 구축토록 하였다.비해 초음파 감시하 치골상부 방광천자가 정확하고 안전한 채뇨법으로 권장되어야 한다고 생각한다.應裝置) 및 운용(運用)에 별다른 어려움이 없고, 내열성(耐熱性)이 강(强)하므로 쉬운 조건하(條件下)에서 경제적(經濟的)으로 공업적(工業的) 이용(利用)에 유리(有利)하다고 판단(判斷)되어진다.reatinine은 함량이 적었다. 관능검사결과(官能檢査結果) 자가소화(自家消化)시킨 크릴간장은 효소(酵素)처리한 것이나 재래식 콩간장에 비하여 품질 면에서 손색이 없고 저장성(貯藏性)이 좋은 크릴간장을 제조(製造)할 수 있다는 결론을 얻었다.이 있음을 확인할 수 있었다.에 착안하여 침전시 슬러지층과 상등액의 온도차를 측정하여 대사열량의 발생량을 측정하고 슬러지의 활성을 측정할 수 있는 방법을 개발하였다.enin과 Rhaponticin의 작용(作用)에 의(依)한 것이며, 이는 한의학(韓醫學) 방제(方劑) 원리(原理)인 군신좌사(君臣佐使) 이론(理論)에서 군약(君藥)이 주증(主症)에 주(主)로 작용(作用)하는 약물(藥物)이라는 것을 밝혀주는 것이라고 사료(思料)된다.일전 $13.447\;{\mu}g/hr/g$, 섭취 7일중 $8.123

• Journal of Korea Spatial Information System Society
• /
• v.7 no.2 s.14
• /
• pp.47-56
• /
• 2005

Recently, with the rapid development of mobile computing, wireless positioning technologies, and the generalization of wireless internet, LBS (Location Based Service) which utilizes location information of moving objects is serving in many fields. In order to serve LBS efficiently, the location data server that periodically stores location data of moving objects is required. Formerly, GIS servers have been used to store location data of moving objects. However, GIS servers are not suitable to store location data of moving objects because it was designed to store static data. Therefore, in this paper, we designed and implemented an extended SLDS(Short-term Location Data Subsystem) for real-time Location Based Services. The extended SLDS is extended from the SLDS which is a subsystem of the GALIS(Gracefully Aging Location Information System) architecture that was proposed as a cluster-based distributed computing system architecture for managing location data of moving objects. The extended SLDS guarantees real-time service capabilities using the TMO(Time-triggered Message-triggered Object) programming scheme and efficiently manages large volume of location data through distributing moving object data over multiple nodes. The extended SLDS also has a little search and update overhead because of managing location data in main memory. In addition, we proved that the extended SLDS stores location data and performs load distribution more efficiently than the original SLDS through the performance evaluation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.1
• /
• pp.33-46
• /
• 2003

A Home Location Register(HLR) database system manages each subscriber's location information, which continuously changes in a cellular network. For this purpose, the HLR database system provides table management, index management, and backup management facilities. In this thesis, we propose using a two-level index method for the mobile directory number(MDN) as a suitable method and a chained bucket hashing method for the electronic serial number(ESN). Both the MDN and the ESN are used as keys in the HLR database system. We also propose an efficient backup method that takes into account the characteristics of HLR database transactions. The retrieval speed and the memory usage of the two-level index method are better than those of the R-tree index method. The insertion and deletion overhead of the chained bucket hashing method is less than that of the modified linear hashing method. In the proposed backup method, we use two kinds of dirty flags in order to solve the performance degradation problem caused by frequent registration-location operations. For a million subscribers, proposed techniques support reduction of memory size(more than 62%), directory operations (2500,000 times), and backup operations(more than 80%) compared with current techniques.

• Journal of Internet Computing and Services
• /
• v.15 no.4
• /
• pp.125-133
• /
• 2014

The column-oriented database storage is a very advanced model for large-volume data analysis systems because of its superior I/O performance. Traditional data storages exploit row-oriented storage where the attributes of a record are placed contiguously in hard disk for fast write operations. However, for search-mostly datawarehouse systems, column-oriented storage has become a more proper model because of its superior read performance. Recently, solid state drive using MLC flash memory is largely recognized as the preferred storage media for high-speed data analysis systems. The features of non-volatility, low power consumption, and fast access time for read operations are sufficient grounds to support flash memory as major storage components of modern database servers. However, we need to improve traditional transaction management scheme due to the relatively slow characteristics of column compression and flash operation as compared to RAM memory. In this research, we propose a new scheme called Column-aware Multi-Version Locking (CaMVL) scheme for efficient transaction processing. CaMVL improves transaction performance by using compression lock and multi version reads for efficiently handling slow flash write/erase operation in lock management process. We also propose a simulation model to show the performance of CaMVL. Based on the results of the performance evaluation, we conclude that CaMVL scheme outperforms the traditional scheme.

• Journal of Korean Society for Geospatial Information Science
• /
• v.17 no.3
• /
• pp.97-107
• /
• 2009

Experiments using real guided weapons for the development of the LADAR(Laser radar) are not practical. Therefore, we need computing environment that can simulate the 3D detections by LADAR. Such simulations require dealing with large sized data representing buildings and terrain over large area. And they also need the information of 3D target objects, for example, material and echo rate of building walls. However, currently used 3D models are mostly focused on visualization maintained as file-based formats and do not contain such semantic information. In this study, as a solution to these problems, a method to use a spatial DBMS and a 3D model suitable for LADAR simulation is suggested. The 3D models found in previous studies are developed to serve different purposes, thus, it is not easy to choose one among them which is optimized for LADAR simulation. In this study, 4 representative 3D models are first defined, each of which are tested for different performance scenarios. As a result, one model, "Body-Face", is selected as being the most suitable model for the simulation. Using this model, a test simulation is carried out.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.6
• /
• pp.786-792
• /
• 2010

This paper presents a real-time lane detection method which can accurately find the lane-mark boundaries in complex road environment. Unlike many existing methods that pay much attention on the post-processing stage to fit lane-mark position among a great deal of outliers, the proposed method aims at removing those outliers as much as possible at feature extraction stage, so that the searching space at post-processing stage can be greatly reduced. To achieve this goal, a grid-based morphology operation is firstly used to generate the regions of interest (ROI) dynamically, in which a directional edge-linking algorithm with directional edge-gap closing is proposed to link edge-pixels into edge-links which lie in the valid directions, these directional edge-links are then grouped into pairs by checking the valid lane-mark width at certain height of the image. Finally, lane-mark colors are checked inside edge-link pairs in the YUV color space, and lane-mark types are estimated employing a Bayesian probability model. Experimental results show that the proposed method is effective in identifying lane-mark edges among heavy clutter edges in complex road environment, and the whole algorithm can achieve an accuracy rate around 92% at an average speed of 10ms/frame at the image size of $320{\times}240$.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.5
• /
• pp.345-353
• /
• 2003

When designing network processors or implementing network equipments such as routers are implemented, IP lookup operations cause the major impact on their performance. As the organization of the IP address becomes simpler, the speed of the IP lookup operations can go faster. However, since the efficient management of IP address is inevitable due to the increasing number of network users, the address organization should become more complex. Therefore, for both IPv4(IP version 4) and IPv6(IP version 6), it is the essential fact that IP lookup operations are difficult and tedious. Lots of researcher for improving the performance of IP lookups have been presented, but the good solution has not been came out. Software approach alleviates the memory usage, but at the same time it si slow in terms of searching speed when performing an IP lookup. Hardware approach, on the other hand, is fast, however, it has disadvantages of producing hardware overheads and high memory usage. In this paper, conventional researches on IP lookups are shown and their advantages and disadvantages are explained. In addition, by mixing two representative structures, a new hybrid parallel architecture for fast IP lookups is proposed. The performance evaluation result shows that the proposed architecture provides better performance and lesser memory usage.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.2
• /
• pp.84-91
• /
• 2009

This paper presents an online partial 3D modeling methodology that uses a mobile augmented reality system and aerial photographs, and a tracking methodology that compares the 3D model with a video image. Instead of relying on models which are created in advance, the system generates a 3D model for a real building on the fly by combining frontal and aerial views. A user's initial pose is estimated using an aerial photograph, which is retrieved from a database according to the user's GPS coordinates, and an inertial sensor which measures pitch. We detect edges of the rooftop based on Graph cut, and find edges and a corner of the bottom by minimizing the proposed cost function. To track the user's position and orientation in real-time, feature-based tracking is carried out based on salient points on the edges and the sides of a building the user is keeping in view. We implemented camera pose estimators using both a least squares estimator and an unscented Kalman filter (UKF). We evaluated the speed and accuracy of both approaches, and we demonstrated the usefulness of our computations as important building blocks for an Anywhere Augmentation scenario.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.2
• /
• pp.113-121
• /
• 2012

In this paper, we proposed fast and efficient algorithm for detecting near-duplication based on content based retrieval in large scale video database. For handling large amounts of video easily, we split the video into small segment using scene change detection. In case of video services and copyright related business models, it is need to technology that detect near-duplicates, that longer matched video than to search video containing short part or a frame of original. To detect near-duplicate video, we proposed motion distribution and frame descriptor in a video segment. The motion distribution descriptor is constructed by obtaining motion vector from macro blocks during the video decoding process. When matching between descriptors, we use the motion distribution descriptor as filtering to improving matching speed. However, motion distribution has low discriminability. To improve discrimination, we decide to identification using frame descriptor extracted from selected representative frames within a scene segmentation. The proposed algorithm shows high success rate and low false alarm rate. In addition, the matching speed of this descriptor is very fast, we confirm this algorithm can be useful to practical application.