• Title/Summary/Keyword: stream computing

Search Result 191, Processing Time 0.027 seconds

An MPEG-4 Contents Authoring System based on Temporal Constraints Model supporting User Interaction (사용자 상호작용 지원 시간 제약 모델 기반 MPEG-4 컨텐츠 저작 시스템)

  • 김희선;김상욱
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.9 no.2
    • /
    • pp.182-190
    • /
    • 2003
  • For temporal relations of interactive media such as MPEG-4, it is necessary for a temporal model that can update dynamically presentation time and temporal relations among objects by user events occurring during playback. Also, 811hough the temporal attributes are changed by user events, the validity of scene must be maintained. In this paper, we propose a temporal model that supports user interaction and developed an MPES-4 contents authoring system applying this model. We define the temporal relations of MPEG-4 that tan be authored and user interactions that can change the temporal properties. This authoring system defines the constraints on temporal relations and events and can generate the scene without error by checking the constraints. Also it provides the authoring environment to author visual]y temporal relations and events in MPEG-4 scene and generates the MPEG-4 stream by encoding the authored scene.

Efficient Locality-Aware Traffic Distribution in Apache Storm (Apache Storm에서 지역성을 고려한 효율적인 트래픽 분배)

  • Son, Siwoon;Lee, Sanghun;Moon, Yang-Sae
    • KIISE Transactions on Computing Practices
    • /
    • v.23 no.12
    • /
    • pp.677-683
    • /
    • 2017
  • Apache Storm is a representative real-time distributed processing system, which is able to process data streams quickly over distributed servers. Storm currently provides several stream grouping methods to distribute data traffic to multiple servers. Among them, the shuffle grouping may cause a processing delay problem and the local-or-shuffle grouping used to solve the problem may cause the problem of concentrating the traffic on a specific node. In this paper, we propose the locality-aware grouping to solve the problems that may arise in the existing Storm grouping methods. Experimental results show that the proposed locality-aware grouping is considerably superior to the existing shuffle grouping and the local-or-shuffle grouping. These results show that the new grouping is an excellent approach considering both the locality and load balancing which are limitations of the existing Storm.

Design of Smart OTT Platform based on the Analysis of Adaptive Buffering (적응 버퍼링 성능분석 기반의 스마트 OTT 플랫폼 설계☆)

  • Kim, Inki;Kang, Mingoo
    • Journal of Internet Computing and Services
    • /
    • v.17 no.4
    • /
    • pp.19-26
    • /
    • 2016
  • In this paper, the dynamic buffering based smart OTT platform was proposed, and analyzed for adaptive bit-rate video delivery with the optimization of HLS (HTTP Live Streaming). This platform consists of the software platform between sever and client which detects the bandwidth capacity, and adjusts the quality of the streaming for multiple bit-rates resolutions. In order to apply adaptive buffering, two buffers are added to the basic HLS player, and each buffer is responsible for constantly buffering a previous and the next channels relative to the current channel. This adaptive transmitting with smart OTT platform is superior to delivering a static video file at a single buffering, because the video stream of adaptive double buffers can be switched streaming according to client's available network speed. As a result, this proposed smart OTT can be cooperated to the application of HLS server with segmented H.265 MPEG-2 TS video & m3u8 files with its information based on the optimized transmission channel state of live and VOD, and applied to PLC transmission, too.

Meta-server Model for Middleware Supporting for Context Awareness (상황인식을 지원하는 미들웨어를 위한 메타서버 모델)

  • Lee, Seo-Jeong;Hwang, Byung-Yeon;Yoon, Yong-Ik
    • Journal of Korea Spatial Information System Society
    • /
    • v.6 no.2 s.12
    • /
    • pp.39-49
    • /
    • 2004
  • An increasing number of distributed applications will be achieved with mobile technology. These applications face temporary loss of network connectivity when they move. They need to discover other hosts in an ad-hoc manner, and they are likely to have scarce resources including CPU speed, memory and battery power. Software engineers building mobile applications need to use a suitable middleware that resolves these problems and offers appropriate support for developing mobile applications. In this paper, we describe the meta-server building for middleware that addresses reflective context awareness and present usability with demonstration. Metadata is consist of user configuration, device configuration, user context, device context and dynamic image metadata. When middleware send a saving or retrieval request to meta-server, it returns messages to middleware after the verification of the request. This meta-server has the application for multimedia stream services with context awareness.

  • PDF

Network Adaptive Prefetching for Constant QoS Guarantee in Media Streaming (미디어 스트리밍에서 일정한 QoS보장을 위한 네트워크 적응적 프리페칭 기법)

  • Lee, Joa-Hyoung;Jung, In-Bum
    • The KIPS Transactions:PartC
    • /
    • v.15C no.6
    • /
    • pp.547-556
    • /
    • 2008
  • Recently, with the advance of computing and networking technique, the high speed internet becomes widespread, however, it is still hard job to do streaming the media which requires high network bandwidth over the internet. Previous researches for streaming over the internet mainly proposed techniques that controls the QoS(Quality of Service) of the media in proportion to the network status. Though, this could be the solution for the service provider while the service user who wants constant QoS may not satisfy with variable QoS. In the paper, we propose a network adaptive prefetching technique, NAP, for guarantee of constant QoS. The NAP prefetches frames by increasing the frame transmission rate while the available network bandwidth is high. The NAP uses the prefetched frames to guarantee the QoS while the available network bandwidth is low. The experiment result shows that the proposed NAP could guarantee the constant QoS by prefetching the frames adaptively to the network bandwidth with the characteristic of video stream.

Automatic C Source Code Generation Technique for DirectShow Programming (DirectShow 프로그래밍을 위한 C 소스 코드 자동 생성 기법)

  • 동지연;박선화;엄성용
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.1
    • /
    • pp.114-124
    • /
    • 2004
  • In this paper, we present an automatic C source code generation system for DirectShow based multimedia application programming. In this system, C source code is automatically synthesized from the filter connection graph edited with GraphEdit, a utility tool provided with DirectShow SDK package from Microsoft. In traditional DirectShow programming environments, program design and brief testing steps are usually done with GraphEdit tool just by inserting filters and connecting them properly, while actual implementation of the program should be done separately. The filter connection graph information from GraphEdit is used just as a reference in such the implementation step. Therefore, our system which automatically generates C source code directly from the filter connection graph of GraphEdit seems very useful and many programmers can develop DirectShow based multimedia application programs more effectively and quickly using our system. In addition, our system supports more various media stream control functions for the generated application programs than the existing system such as Wizard which supports limited and fixed number of media control functions only. This feature allows more flexibility in the user interface of the generated source program and makes our system more practical for DirectShow based programming.

Hypernetwork Memory-Based Model for Infant's Language Learning (유아 언어학습에 대한 하이퍼망 메모리 기반 모델)

  • Lee, Ji-Hoon;Lee, Eun-Seok;Zhang, Byoung-Tak
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.12
    • /
    • pp.983-987
    • /
    • 2009
  • One of the critical themes in the language acquisition is its exposure to linguistic environments. Linguistic environments, which interact with infants, include not only human beings such as its parents but also artificially crafted linguistic media as their functioning elements. An infant learns a language by exploring these extensive language environments around it. Based on such large linguistic data exposure, we propose a machine learning based method on the cognitive mechanism that simulate flexibly and appropriately infant's language learning. The infant's initial stage of language learning comes with sentence learning and creation, which can be simulated by exposing it to a language corpus. The core of the simulation is a memory-based learning model which has language hypernetwork structure. The language hypernetwork simulates developmental and progressive language learning using the structure of new data stream through making it representing of high level connection between language components possible. In this paper, we simulates an infant's gradual and developmental learning progress by training language hypernetwork gradually using 32,744 sentences extracted from video scripts of commercial animation movies for children.

A Categorization Scheme of Tag-based Folksonomy Images for Efficient Image Retrieval (효과적인 이미지 검색을 위한 태그 기반의 폭소노미 이미지 카테고리화 기법)

  • Ha, Eunji;Kim, Yongsung;Hwang, Eenjun
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.6
    • /
    • pp.290-295
    • /
    • 2016
  • Recently, folksonomy-based image-sharing sites where users cooperatively make and utilize tags of image annotation have been gaining popularity. Typically, these sites retrieve images for a user request using simple text-based matching and display retrieved images in the form of photo stream. However, these tags are personal and subjective and images are not categorized, which results in poor retrieval accuracy and low user satisfaction. In this paper, we propose a categorization scheme for folksonomy images which can improve the retrieval accuracy in the tag-based image retrieval systems. Consequently, images are classified by the semantic similarity using text-information and image-information generated on the folksonomy. To evaluate the performance of our proposed scheme, we collect folksonomy images and categorize them using text features and image features. And then, we compare its retrieval accuracy with that of existing systems.

An Integrated Synchronization Method for a Hyperpresentation in a distributed Computing Environment (분산 컴퓨팅환경에서 하이퍼 프리젠테이션을 위한 통합 동기화 기법)

  • Lim, Young-Hwan;Kim, Doo-Hyun;Kung, Sang-Hwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.6
    • /
    • pp.1441-1456
    • /
    • 1998
  • The concept of a hyperpresmtation, as an extension of a hypermedia, is the presentation in which time-varying multimedia presentations are dynamically linked together and a hyperlink's context can be changed over time at any time during a continuous presentation. Problems caused by integrating the hyperpresentation into an existing multimedia system which handles a sequential presentation only are, how to describe the hyperprcsentation, how to set up a hyperlink on a continuous media, and how to check the consistency of the synchronized presentations. In this paper. a new synchronization description method for the hyperpresentation and a method for setting a hyper link on a continuous media during" presentation are proposed after havin!; SHrvey of existing methods, The proposed method deals with only the DC value in a stream ut a DCT based compressed data for checking a condition of te link. Finally, the method for checking the consistency of mixed presentations before actual play of the hnlerpresentation is described. Proposed methods are implemented on MuX(Multimedia IO Server) where a sample scenario is tested.

  • PDF

Asymmetric RTS/CTS for Exposed Node Reduction in IEEE 802.11 Ad Hoc Networks

  • Matoba, Akihisa;Hanada, Masaki;Kanemitsu, Hidehiro;Kim, Moo Wan
    • Journal of Computing Science and Engineering
    • /
    • v.8 no.2
    • /
    • pp.107-118
    • /
    • 2014
  • One interesting problem regarding wireless local area network (WLAN) ad-hoc networks is the effective mitigation of hidden nodes. The WLAN standard IEEE 802.11 provides request to send/clear to send (RTS/CTS) as mitigation for the hidden node problem; however, this causes the exposed node problem. The first 802.11 standard provided only two transmission rates, 1 and 2 Mbps, and control frames, such as RTS/CTS assumed to be sent at 1 Mbps. The 802.11 standard has been enhanced several times since then and now it supports multi-rate transmission up to 65 Mbps in the currently popular 802.11n (20 MHz channel, single stream with long guard interval). As a result, the difference in transmission rates and coverages between the data frame and control frame can be very large. However adjusting the RTS/CTS transmission rate to optimize network throughput has not been well investigated. In this paper, we propose a method to decrease the number of exposed nodes by increasing the RTS transmission rate to decrease RTS coverage. Our proposed method, Asymmetric Range by Multi-Rate Control (ARMRC), can decrease or even completely eliminate exposed nodes and improve the entire network throughput. Experimental results by simulation show that the network throughput in the proposed method is higher by 20% to 50% under certain conditions, and the proposed method is found to be effective in equalizing dispersion of throughput among nodes.