• Title/Summary/Keyword: 데이터스트림

Search Result 918, Processing Time 0.026 seconds

An efficient storing method of multiple streams based on fixed blocks in disk parititions (디스크 파티션내 고정 블록에 기반한 다중 스트림의 효율적 저장 방식)

  • 최성욱;박승규;최덕규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.9
    • /
    • pp.2080-2089
    • /
    • 1997
  • Recent evolution in compute technology makesthe multimedia processing widely availiable. Conventional storage systems do not meet the requirements of multimedia data. Several approaches were suggested to improve disk storing methods for them. Bocheck proposed a disk partitioning technique for multiple steams assuming that all steams have same retrieval intervals with the same amount data for each access. While Bocheck's one provides a good method for same period, it does not consider the case of different periods of continous media streams. This paper proposes a new partitioning technique in which a fixed number of blocks are assigned for stresms with different retrieval periodicity. The analysis shows this problem is the same as the one scheduling the steams into a given sequence. The simulation was done to compare the proposed m-sequence merge method with the conventional Scan-EDF and Partitioning methods.

  • PDF

Intrusion Detection based on Clustering a Data Stream (데이터 스트림 클러스터링을 이용한 침임탐지)

  • Oh Sang-Hyun;Kang Jin-Suk;Byun Yung-Cheol
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2005.11a
    • /
    • pp.529-532
    • /
    • 2005
  • In anomaly intrusion detection, how to model the normal behavior of activities performed by a user is an important issue. To extract the normal behavior as a profile, conventional data mining techniques are widely applied to a finite audit data set. However, these approaches can only model the static behavior of a user in the audit data set This drawback can be overcome by viewing the continuous activities of a user as an audit data stream. This paper proposes a new clustering algorithm which continuously models a data stream. A set of features is used to represent the characteristics of an activity. For each feature, the clusters of feature values corresponding to activities observed so far in an audit data stream are identified by the proposed clustering algorithm for data streams. As a result, without maintaining any historical activity of a user physically, new activities of the user can be continuously reflected to the on-going result of clustering.

  • PDF

A Study of Real-Time Video Streaming Data Service on the Linux Server (리눅스 서버를 이용한 동영상 데이터 실시간 스트리밍 서비스 연구)

  • Jang, Seung-Ju;Heo, Won-Yeong;Yoo, Hyun-Min;Lee, Chang-Hoon;Shin, Woo-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.4
    • /
    • pp.893-901
    • /
    • 2013
  • This paper suggests a method of developing live media streaming service through Linux server system on android system environment. The android application constructed in the experiment is able to record media while sending it to Linux server. Generated real time media data is send to linux server through Multipart Request class of Apache Tomcat server constructed on Linux system. Also in this research, by utilizing Android video player and media player class, development of android application structures was accomplished, which has methods of; playing live media stream data on video server, or playing live media stream data while saving stream data in cache. The structure and function of suggested system and application is confirmed by series of experiments.

Analysis of Trend for BigData Processing Technology by DW Appliance (DW 어플라이언스를 통한 빅데이터 처리 기술 동향 분석)

  • Choi, Ro-Hwan;Park, Seok-Cheon;Sim, Bong-Soo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.05a
    • /
    • pp.904-907
    • /
    • 2013
  • 최근 정보통신기술이 하루가 다르게 발전함에 따라 하루에도 수많은 데이터가 흘러나오는 최근의 추세이다. 정형 데이터 뿐 아니라 비정형 데이터 분석까지 진행하는 최근의 추세에 맞춰 현 빅데이터 기술 동향을 분석한다. 빅데이터 시대를 맞아 기존의 데이터웨어하우스(DW)와 발전된 데이터웨어하우스(DW) 어플라이언스에 대해 분석하고 향후 발전 전망과 방향을 제시한다.

An Energy-Aware Multi-tree Video Multicast Scheme in Wireless Ad Hoc Networks (무선 애드 혹 네트워크에서 잔여 에너지를 고려한 다중 트리 비디오 멀티캐스트 기법)

  • Park, Jae-Young;Kang, Kyung-Ran;Cho, Young-Jong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1336-1348
    • /
    • 2009
  • In this paper, we propose an energy-aware multi-tree video multicast scheme for wireless ad hoc networks. Some network nodes may have energy enough to receive and forward the whole video content whereas some may not. Even though the video quality may vary depending on the remaining energy, our scheme enables the low-energy nodes to join the video multicast session. The video stream is split into a set of multiple and independent descriptions by MDC (Multiple description coding) scheme. Each description corresponds to a substream and number of substreams determine the video quality. The member nodes determine how many substreams it would receive depending on the remaining energy and expected amount of packets per substream. So does the intermediate tree nodes. That builds a tree per substream and multiple trees per session. The data source disseminates each substream through corresponding tree. The video quality of the member nodes varies according to number of participating trees. We evaluate the performance of our scheme by simulation. Our scheme showed better peak signal to noise ratio and extended the lifetime of the network nodes compared with MAODV, which builds a single tree, and MT-MAODV, which builds multiple trees but does not consider the available energy.

A product recommendation system based on adjacency data (인접성 데이터를 이용한 추천시스템)

  • Kim, Jin-Hwa;Byeon, Hyeon-Su
    • Journal of the Korean Data and Information Science Society
    • /
    • v.22 no.1
    • /
    • pp.19-27
    • /
    • 2011
  • Recommendation systems are developed to overcome the problems of selection and to promote intention to use. In this study, we propose a recommendation system using adjacency data according to user's behavior over time. For this, the product adjacencies are identified from the adjacency matrix based on graph theory. This research finds that there is a trend in the users' behavior over time though product adjacency fluctuates over time. The system is tested on its usability. The tests show that implementing this recommendation system increases users' intention to purchase and reduces the search time.

The Streaming Server Design and Implementation for ATSC Data Broadcast (ATSC 데이터 방송 스트리밍 서버 설계 및 구현)

  • 박민식;김용석;김재곤
    • Proceedings of the IEEK Conference
    • /
    • 2000.09a
    • /
    • pp.317-320
    • /
    • 2000
  • 본 논문은 양방향 디지털 텔레비전에서 데이터의 전송을 위해 데이터 전송 스트림을 생성하는 스트리밍 서버의 구조 및 기능, 시스템 구현에 관해 서술한다 이 시스템은 ATSC 데이터 방송 규격에서 정의하는 비동기데이터, IP 데이터그램, 동기 및 동기화된 데이터의 전송 기능을 지원하며 국제 전송 규격인 MPEG-2 시스템규격 및 ATSC 데이터 방송 규격에 따라 PC 환경하에서 소프트웨어적으로 구현 되었다.

  • PDF

Effective Load Shedding for Multi-Way windowed Joins Based on the Arrival Order of Tuples on Data Streams (다중 윈도우 조인을 위한 튜플의 도착 순서에 기반한 효과적인 부하 감소 기법)

  • Kwon, Tae-Hyung;Lee, Ki-Yong;Son, Jin-Hyun;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.37 no.1
    • /
    • pp.1-11
    • /
    • 2010
  • Recently, there has been a growing interest in the processing of continuous queries over multiple data streams. When the arrival rates of tuples exceed the memory capacity of the system, a load shedding technique is used to avoid the system becoming overloaded by dropping some subset of input tuples. In this paper, we propose an effective load shedding algorithm for multi-way windowed joins over multiple data streams. Most previous load shedding algorithms estimate the productivity of each tuple, i.e., the number of join output tuples produced by the tuple, based on its "join attribute value" and drop tuples with the lowest productivity. However, the productivity of a tuple cannot be accurately estimated from its join attribute value when the join attribute values are unique and do not repeat, or the distribution of the join attribute values changes over time. For these cases, we estimate the productivity of a tuple based on its "arrival order" on data streams, rather than its join attribute value. The proposed method can effectively estimate the productivity of a tuple even when the productivity of a tuple cannot be accurately estimated from its join attribute value. Through extensive experiments and analysis, we show that our proposed method outperforms the previous methods in terms of effectiveness and efficiency.

Development of Conformance Test Tools for Terrestrial DMB Broadcast Web Site Services (지상파 DMB 방송웹사이트 서비스 송수신 정합 시험 도구 개발)

  • Kim, Yong-Han;Moon, Su-Han;Chae, Young-Seok
    • Journal of Broadcast Engineering
    • /
    • v.12 no.3
    • /
    • pp.214-221
    • /
    • 2007
  • In this paper, we presents conformance test tools for the broadcast web site (BWS) service which is one of the data services for terrestrial digital multimedia broadcasting (T-DMB). First, the methodology for the conformance test is established for both transmitters and receivers of T-DMB BWS services. The test tools consist of three parts: BWS bitstream analyzer, BWS reference decoder (software) module, and BWS test bitstreams. For testing transmitted BWS bitstreams, we developed the bitstream analyzer. For testing BWS receivers, we developed the reference Ifecoder module and created the test bitstreams. Actually the bitstream analyzer developed in this paper was used for the verification of the test bitstreams. The same test bitstreams are fed to a BWS decoder module under test and the reference decoder module and the results from the two are compared for verification. The test tools can be used for the test of all the protocol and textual/image specifications related to BWS including MOT protocol, HTML, PNG, MNG, JPEG, and Ecma Script.