• 제목/요약/키워드: retrieving

Search Result 549, Processing Time 0.026 seconds

A Light-weight and Dynamically Reconfigurable RMON Agent System

  • Lee, Jun-Hyung;Park, Zin-Won;Kim, Myung-Kyun
    • Journal of Information Processing Systems
    • /
    • v.2 no.3 s.4
    • /
    • pp.183-188
    • /
    • 2006
  • A RMON agent system, which locates on a subnet, collects the network traffic information for management by retrieving and analyzing all of the packets on the subnet. The RMON agent system can miss some packets due to the high packet analyzing overhead when the number of packets on the subnet is huge. In this paper, we have developed a light-weight RMON agent system that can handle a large amount of packets without packet loss. Our RMON agent system has also been designed such that its functionality can be added dynamically when needed. To demonstrate the dynamic reconfiguration capability of our RMON agent system, a simple port scanning attack detection module is added to the RMON agent system. We have also evaluated the performance of our RMON agent system on a large network that has a huge traffic. The test result has shown our RMON agent system can analyze the network packets without packet loss.

Estimation of Aerosol Optical Thickness over East Asia Using GMS-5 Visible Channel Measurements (GMS-5 위성의 가시자료를 이용한 동아시아 지역의 에어로솔 광학두께 추정)

  • Urm, Young-Dae;Sohn, Byung-Ju
    • Atmosphere
    • /
    • v.15 no.4
    • /
    • pp.203-211
    • /
    • 2005
  • One algorithm has been developed for retrieving aerosol optical thickness from GMS-5 visible channel measurements, and then the algorithm was applied for obtaining the geographical distribution of aerosol optical thickness over East Asia during April 2002. Algorithm employs a look-up table based upon radiative transfer calculations with solar geometry, aerosol optical thickness, and surface albedo as inputs. Validation was conducted by comparing retrieved aerosol optical thickness with measured values from ground-based sky radiation measurements at Anmyon Do, Korea. It was found that the correlation coefficient is 0.71 with -0.03 of bias and 0.34 of root mean square error, suggesting that the algorithm developed in this study can be used for estimating aerosol optical thickness in a quantitative sense.

A Mathematical Programming Approach for Block Storage Problem in Shipbuilding Process (수리 모형을 이용한 조선 산업에서의 블록 적치장 최적 운영 계획 도출)

  • Ha, Byung-Hyun;Son, Jung-Ryoul;Cho, Kyu Kab;Choi, Byung-Cheon
    • Korean Management Science Review
    • /
    • v.30 no.3
    • /
    • pp.99-111
    • /
    • 2013
  • This paper studies the scheduling problem of storing and retrieving assembly blocks in a temporary storage yard. The objective is to minimize the number of relocations of blocks while the constraints for storage and retrieval time windows are satisfied. We present an integer programming model based on multi-commodity network flows, and the three revised models based on the properties of the problem. We show that the revised models are more efficient than the generic model through the numerical experiments.

Development of Influence Diagram Based Knowledge Base in Probabilistic Reasoning (인플루언스 다이아그램을 기초로 한 이상진단 지식베이스의 개발)

  • 김영진
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.17 no.12
    • /
    • pp.3124-3134
    • /
    • 1993
  • Diagnosis is composed of two different but interrelated steps ; retrieving the sensory responses f the system and reasoning the state of the system through the given sensor data. This paper explains the probabilistic nature of reasoning involved in the diagnosis when the uncertainties are inevitably included in experts' diagnostic decision making. Uncertainties in decision making are experts' personal experiences, preferences, and system's coherent characteristics. In order to ensure a consistent decision based on the same responses from the system, expert system technology is adopted with the Bayesian reasoning scheme.

Mitigating Cache Pollution Attack in Information Centric Mobile Internet

  • Chen, Jia;Yue, Liang;Chen, Jing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.11
    • /
    • pp.5673-5691
    • /
    • 2019
  • Information centric mobile network can significantly improve the data retrieving efficiency by caching contents at mobile edge. However, the cache pollution attack can affect the data obtaining process severely by requiring unpopular contents deliberately. To tackle the problem, we design an algorithm of mitigating cache pollution attacks in information centric mobile network. Particularly, the content popularity distribution statistic is proposed to detect abnormal behavior. Then a probabilistic caching strategy based on abnormal behavior is applied to dynamically maintain the steady-state distribution for content visiting probability and achieve the purpose of defense. The experimental results show that the proposed scheme can achieve higher request hit ratio and smaller latency for false locality content pollution attack than the CacheShield approach and the baseline approach where no mitigation approach is applied.

End-to-End Generative Question-Answering Chat System Using Copying and Retrieving Mechanisms (복사 방법 및 검색 방법을 이용한 종단형 생성 기반 질의응답 채팅 시스템)

  • Kim, Sihyung;Kim, HarkSoo;Kwon, Oh-Woog;Kim, Young-Gil
    • 한국어정보학회:학술대회논문집
    • /
    • 2017.10a
    • /
    • pp.25-28
    • /
    • 2017
  • 채팅 시스템은 기계와 사람이 서로 의사소통 하는 시스템이다. 의사소통 과정에서 질문을 하고 질문에 대한 답변을 하는 질의응답 형태의 의사소통이 상당히 많다. 그러나 기존 생성 기반 채팅 시스템에서 자주 사용되는 Sequence-to-sequence모델은 질문에 대한 답변보다는 좀 더 일반적인 문장을 생성하는 경우가 대부분이다. 이러한 문제를 해결하기 위해 본 논문에서는 복사 방법과 검색 방법을 이용한 생성 기반 질의응답 채팅 시스템을 제안한다. 템플릿 기반으로 구축한 데이터를 통한 실험에서 제안 시스템은 복사 방법만 이용한 질의응답 시스템 보다 45.6% 높은 정확도를 보였다.

  • PDF

Analysis of Storage and Retrieval Results of Audio Sources and Signatures using Blockchain and Distributed Storage System

  • Lee, Kyoung-Sik;Kim, Sang-Kyun
    • Journal of Broadcast Engineering
    • /
    • v.24 no.7
    • /
    • pp.1228-1236
    • /
    • 2019
  • Recently, media platforms such as YouTube and Twitch provide services that can generate personal revenue by utilizing media content produced by individuals. In this regard, interest in the copyright of media content is increasing. In particular, in the case of an audio source, competition for securing audio source copyright is fierce because it is an essential element for almost all media content production. In this paper, we propose a method to store the audio source and its signature using a blockchain and distributed storage system to verify the copyright of music content. To identify the possibility of extracting the audio signature of the audio source and to include it as blockchain transaction data, we implement the audio source and its signature file upload system based on the proposed scheme. In addition, we show the effectiveness of the proposed method through experiments on uploading and retrieving audio files and identify future improvements.

Design and Implementation of CMS using MVC Framework (MVC 프레임워크 기반의 CMS 설계 및 구현)

  • 이준희
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2003.11a
    • /
    • pp.157-160
    • /
    • 2003
  • Web services can be invoked statically using a WSDL service interface and service implementation documents, or dynamically by retrieving the service type definitions and the service implementation via UDDI. But until now, couldn't do both at the same time. The Model View Controller pattern(MVC) supports both dynamic and static Web services. The MVC paradigm is a way of breaking an application, or even just a piece of an application's interface, into three parts: the model, the view, and the controller. Object-oriented methodologies have been applied to developing internet applications for increase reuse and expandability. I supposed a effective multimedia CMS(Contents Management Systems) using MVC.

  • PDF

Dynamic Compressed Representation of Texts with Rank/Select

  • Lee, Sun-Ho;Park, Kun-Soo
    • Journal of Computing Science and Engineering
    • /
    • v.3 no.1
    • /
    • pp.15-26
    • /
    • 2009
  • Given an n-length text T over a $\sigma$-size alphabet, we present a compressed representation of T which supports retrieving queries of rank/select/access and updating queries of insert/delete. For a measure of compression, we use the empirical entropy H(T), which defines a lower bound nH(T) bits for any algorithm to compress T of n log $\sigma$ bits. Our representation takes this entropy bound of T, i.e., nH(T) $\leq$ n log $\sigma$ bits, and an additional bits less than the text size, i.e., o(n log $\sigma$) + O(n) bits. In compressed space of nH(T) + o(n log $\sigma$) + O(n) bits, our representation supports O(log n) time queries for a log n-size alphabet and its extension provides O(($1+\frac{{\log}\;{\sigma}}{{\log}\;{\log}\;n}$) log n) time queries for a $\sigma$-size alphabet.

An Implementation of Recoding & Retrieval Method for Video Monitoring System (비디오 감시 시스템을 위한 감시영상의 기록 및 검색 방법 구현)

  • Hwang, Byung-Kon
    • Journal of Satellite, Information and Communications
    • /
    • v.7 no.3
    • /
    • pp.140-144
    • /
    • 2012
  • The classic method of recording and retrieving of images for video monitoring was very inefficient since the system required huge storage capacity. It's because it stored images without separating background and monitored objects. The recording and retrieval method of images for the video monitoring system we proposed in this paper makes it possible to retrieve images easily by using database by the hour and the place. Hence, it retrieve images much more efficiently than the existing method.