• Journal of Internet Computing and Services
• /
• v.16 no.2
• /
• pp.27-40
• /
• 2015

Inferring firewall policy is to discover firewall policy by analyzing response packets as results of active probing without any prior information. However, a brute-force approach for generating probing packets is unavailable because the probing packets may be regarded as attack traffic and blocked by attack detection threshold of a firewall. In this paper, we propose a firewall policy inference method using an efficient probing algorithm which considers the number of source IP addresses, maximum probing packets per second and interval size of adjacent sweep lines as inference parameters to avoid detection. We then verify whether the generated probing packets are classified as network attack patterns by a firewall, and present the result of evaluation of the correctness by comparing original firewall policy with inferred firewall policy.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.190-199
• /
• 1999

Presented in this paper is an algorithm for finding all intersections among polygonal chains with an O((n+k)·log m) worst-case time complexity, where n is the number of lien segments in the polygonal chains, k is the number of intersections, and m is the number of monotone chains. The proposed algorithm is based on the sweep line algorithm. Unlike the previous polygonal-chain intersection algorithms that are designed to handle special only cases, such as convex polygons or C-oriented polygons, the proposed algorithm can handle arbitrarily shaped polygonal chains having self-intersections and singularities (tangential contact, multiple intersections). The algorithms has been implemented and applied to 1) testing simplicity of a polygon, 2) finding intersections among polygons and 3) offsetting planar point-sequence curves.

• Journal of ILASS-Korea
• /
• v.7 no.2
• /
• pp.1-6
• /
• 2002

It is necessary to develope a high frequency diode laser sensor system based on the absorption spectroscopy for the measurement of temperature of the spray flame. DFB diode laser operating near $2.0{\mu}m$ was used to scan over selected $H_2O$ transitions near $1.9{\mu}m\;and\;2.2{\mu}m$, respectively. The measurement sensitivity at wide range of sweep frequency was evaluated using multi-pass cell containing $CO_2$ gas. This diode laser absorption sensor with high temporal resolution up to 10kHz was applied to measure the gas temperature in the spray flame region of liquid-gas 2-phase counter flow flame. The successful demonstration of time series temperature measurement in the spray flame gives us motivation of trying to establish non-intrusive temperature measurement method in the practical spray flame.

• Bulletin of the Korean Chemical Society
• /
• v.20 no.9
• /
• pp.1040-1044
• /
• 1999

A micro porous PTFE membrane desolvator (MMD) was built and evaluated for the on-line removal of organic solvents to facilitate the determination of trace metal contaminants in the solvents by ICP-AES. Three organic solvents, isopropyl alcohol (IPA), methanol, and dimethy sulfoxide (DMSO) were studied. The MMD reduced organic solvent concentration in the sample aerosol stream by 82% to 89%, as indicated by monitoring C(I) emission. Net signal intensity of Fe, Al, and Cu was increasing with higher organic solvent concentration, with the rate of increase being solvent dependent. The signal intensities for Mg and Pb followed the trend with the C(I) signal. Changing the sweep gas flow rate affected the optimum signal intensity. Wine samples were analyzed by the method of standard addition. The concentrations of B, Al, and Mg were determined with a relative precision of less than 2.3%.

• Journal of KIISE
• /
• v.43 no.1
• /
• pp.40-46
• /
• 2016

Digital road map generation is primarily based on artificial satellite photographing or in-site manual survey work. Therefore, these map generation procedures require a lot of time and a large budget to create and update road maps. Consequently, people have tried to develop automated map generation systems using GPS trajectory data sets obtained by public vehicles. A fundamental problem in this road generation procedure involves the extraction of representative trajectory such as main roads. Extracting a representative trajectory requires the base data set of piecewise line segments(GPS-trajectories), which have close starting and ending points. So, geometrically similar trajectories are selected for clustering before extracting one representative trajectory from among them. This paper proposes a new divide- and-conquer approach by partitioning the whole map region into regular grid sub-spaces. We then try to find similar trajectories by sweeping. Also, we applied the $Fr{\acute{e}}chet$ distance measure to compute the similarity between a pair of trajectories. We conducted experiments using a set of real GPS data with more than 500 vehicle trajectories obtained from Gangnam-gu, Seoul. The experiment shows that our grid partitioning approach is fast and stable and can be used in real applications for vehicle trajectory clustering.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.32 no.1
• /
• pp.33-41
• /
• 1996

In order to obtain the most favourable classification system for fishing gears, the problems in the existing systems were investigated and a new system in which the fishing method was adopted as the criterion of classification and the kinds of fishing gears were obtained by exchanging the word method into gear in the fishing methods classified newly for eliminating the problems was established. The new system to which the actual gears are arranged is as follows ; (1)Harvesting gear \circled1Plucking gears : Clamp, Tong, Wrench, etc. \circled2Sweeping gears : Push net, Coral sweep net, etc. \circled3Dredging gears : Hand dredge net, Boat dredge net, etc. (2)Sticking gears \circled1Shot sticking gears : Spear, Sharp plummet, Harpoon, etc. \circled2Pulled sticking gears : Gaff, Comb, Rake, Hook harrow, Jerking hook, etc. \circled3Left sticking gears : Rip - hook set line. (3)Angling gears \circled1Jerky angling gears (a)Single - jerky angling gears : Hand line, Pole line, etc. (b)Multiple - jerky angling gears : squid hook. \circled2Idly angling gears (a)Set angling gears : Set long line. (b)Drifted angling gears : Drift long line, Drift vertical line, etc. \circled3Dragged angling gears : Troll line. (4)Shelter gears : Eel tube, Webfoot - octopus pot, Octopus pot, etc. (5)Attracting gears : Fishing basket. (6)Cutoff gears : Wall, Screen net, Window net, etc. (7)Guiding gears \circled1Horizontally guiding gears : Triangular set net, Elliptic set net, Rectangular set net, Fish weir, etc. \circled2Vertically guiding gears : Pound net. \circled3Deeply guiding gears : Funnel net. (8)Receiving gears \circled1Jumping - fish receiving gears : Fish - receiving scoop net, Fish - receiving raft, etc. \circled2Drifting - fish receiving gears (a)Set drifting - fish receiving gears : Bamboo screen, Pillar stow net, Long stow net, etc. (b)Movable drifting - fish receiving gears : Stow net. (9)Bagging gears \circled1Drag - bagging gears (a)Bottom - drag bagging gears : Bottom otter trawl, Bottom beam trawl, Bottom pair trawl, etc. (b)Midwater - drag gagging gears : Midwater otter trawl, Midwater pair trawl, etc. (c)Surface - drag gagging gears : Anchovy drag net. \circled2Seine - bagging gears (a)Beach - seine bagging gears : Skimming scoop net, Beach seine, etc. (b)Boat - seine bagging gears : Boat seine, Danish seine, etc. \circled3Drive - bagging gears : Drive - in dustpan net, Inner drive - in net, etc. (10)Surrounding gears \circled1Incomplete surrounding gears : Lampara net, Ring net, etc. \circled2Complete surrounding gears : Purse seine, Round haul net, etc. (11)Covering gears \circled1Drop - type covering gears : Wooden cover, Lantern net, etc. \circled2Spread - type covering gears : Cast net. (12)Lifting gears \circled1Wait - lifting gears : Scoop net, Scrape net, etc. \circled2Gatherable lifting gears : Saury lift net, Anchovy lift net, etc. (13)Adherent gears \circled1Gilling gears (a)Set gilling gears : Bottom gill net, Floating gill net. (b)Drifted gilling gears : Drift gill net. (c)Encircled gilling gears : Encircled gill net. (d)Seine - gilling gears : Seining gill net. (e)Dragged gilling gears : Dragged gill net. \circled2Tangling gears (a)Set tangling gears : Double trammel net, Triple trammel net, etc. (b)Encircled tangling gears : Encircled tangle net. (c)Dragged tangling gears : Dragged tangle net. \circled3Restrainting gears (a)Drifted restrainting gears : Pocket net(Gen - type net). (b)Dragged restrainting gears : Dragged pocket net. (14)Sucking gears : Fish pumps.

• Journal of the Korean Society of Visualization
• /
• v.14 no.3
• /
• pp.28-31
• /
• 2016

In this study, we investigate the wake characteristics in two cases which are laminar inflow and turbulent inflow. To solve the flow with wind turbines and its wake, we use large eddy simulation (LES) technique with actuator line method (ALM) and turbulent inflow of Turbsim. Turbulent inflow which contains the characteristic of the stable atmospheric boundary layer is used. We perform the quantitative analysis of velocity deficit and turbulence intensity in two cases. Time series of velocity deficit at the first, the second column in two cases are compared to observe the performance of wind turbine. The performance in the first column in laminar inflow is overestimated compared to that in turbulent inflow. And we observe that wake in the case with turbulent inflow drive to the span-wise direction and wake recovery in turbulent inflow is more effective. In quadrant analysis of Reynolds stress, the ejection and the sweep motion in turbulent inflow case are bigger than those in laminar inflow case.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.25 no.11
• /
• pp.1190-1196
• /
• 2014

This paper presents the design of a Frequency Modulated Continuous Wave(FMCW) radar altimeter with wide altitude range and low measurement errors. Wide altitude range is achieved by employing the optic delay in the transmitting path to reduce the dynamic range of measuring altitude. Transmitting power and receiver gain are also controlled to have the dynamic range of the received power be reduced. In addition, low measurement errors are obtained by improving the sweep linearity using the Direct Digital Synthesizer(DDS) and minimizing the phase noise employing the reference clock(Ref_CLK) as the offset frequency of the Phase Locked Loop(PLL).

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.1
• /
• pp.48-52
• /
• 2010

In this paper, we introduce a new path planning algorithm which combines the merits of a visibility graph algorithm and an adaptive cell decomposition. We quantize a given map with empty cells, blocked cells, and mixed cells, then find the optimal path on the quantized map using a visibility graph algorithm. For reducing the number of the quantized cells we use the quad-tree technique which is used in an adaptive cell decomposition, and for improving the performance of the visibility checking in making a visibility graph we propose a new visibility checking method which uses the property of the quad-tree instead of the well-known rotational sweep-line algorithm. For the more efficient visibility checking, we propose two additional improvements for our suggested method. Both of them are used for reducing the visited cells in the quad-tree. The experiments for a performance comparison of our algorithm with other well-known algorithms show that our proposed method is superior to others.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05c
• /
• pp.1595-1598
• /
• 2003

이 논문은 질의와 검색 대상 객체가 모두 이동 객체인 경우, 즉 3 차원 폴리라인(polyline) 형태의 경로를 가지는 객체들 간의 연속(continuous) 최근접 질의 처리에 유용한 기법을 제안한다. 질의경로를 따라 객체를 탐색해가면서 질의에 대한 최근접 정보가 변하는 시점을 찾는 것이 목적인 연속 최근접 질의 처리는 전체 질의 경로에 올바른 최근접 정보 리스트를 제공하지만, 기존의 방법들은 검색 대상 객체가 동적인 경우에 적용되기에는 시간에 따라 움직이는 객체의 위치변화를 처리하지 못하고, 질의 시점과 대상 객체간의 시점을 연관시키기 어렵다는 문제점들을 가지고 있다. 따라서 이 논문에서는 데이터 객체들의 궤적 정보는 STR 트리로 유지하고, 질의 경로 세그먼트와 질의의 시간 인터벌에 포함되는 데이터 객체 세그먼트 모두에 대해 추출시간(sampling time) 선택, 스윕라인(sweep line) 적용, 위치 추정 함수 이용 등의 단계를 처리함으로써, 이 문제를 해결하고 질의 경로 전체에 정확한 최근접 객체 정보 리스트를 제공한다. 제안된 기법은 물류정보시스템, 국방정보시스템, 기상, 교통 등 시공간 이동 객체의 질의를 다루는 시스템에 적용할 수 있다.