• Title/Summary/Keyword: Multiple Streams

Search Result 206, Processing Time 0.023 seconds

Multiple Continuous Skyline Query Processing Over Data Streams (다중 연속 스카이라인 질의의 효율적인 처리 기법)

  • Lee, Yu-Won;Lee, Ki-Yong;Kim, Myoung-Ho
    • The Journal of Society for e-Business Studies
    • /
    • v.15 no.4
    • /
    • pp.165-179
    • /
    • 2010
  • Recently, the processing of data streams such as stock quotes, buy-sell orders, and billing records becomes more important in e-Business environments. Especially, the use of skyline queries over data streams is rapidly increasing to support multiple criteria decision making. Given a set of multi-dimensional tuples, a skyline query retrieves a set of tuples which are not dominated by other tuples. Although there has been much work on processing skyline queries over static datasets, there has been relatively less work on processing multiple skyline queries over data streams. In this paper, we propose an efficient method for processing multiple continuous skyline queries over data streams. The proposed method efficiently identifies which tuple is a skyline tuple of which query, resulting in a lower cost of processing multiple skyline queries. Through performance evaluation, we show the performance advantage of the proposed method.

Adaptation for Object-based MPEG-4 Content with Multiple Streams (다중 스트림을 이용한 객체기반 MPEG-4 컨텐트의 적응 기법)

  • Cha Kyung-Ae
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.3
    • /
    • pp.69-81
    • /
    • 2006
  • In this paper, an adaptive algorithm is proposed in streaming MPEG-4 contents with fluctuating resource amount such as throughput of network conditions. In the area of adaptive streaming issue, a lot of researches have been made on how to represent encoded media(such as video) bitstream in scalable way. By contrast, MPEG-4 supports object-based multimedia content which is composed of various types of media streams such as audio, video, image and other graphical elements. Thus, it can be more effective to provide individual media streams in scalable way for streaming object-based content to heterogeneous environment. The proposed method provides the multiple media streams corresponding to an object with different qualities and bit rate in order to support object based scalability to the MPEG-4 content. In addition, an optimal selection of the multiple streams for each object to meet a given constraint is proposed. The selection process is adopted a multiple choice knapsack problem with multi-step selection for the MPEG-4 objects with different scalability levels. The proposed algorithm enforces the optimal selection process to maintain the perceptual qualities of more important objects at the best effort. The experimental results show that the set of selected media stream for presenting objects meets a current transmission condition with more high perceptual quality.

  • PDF

Object based Scalability Support for Adaptive MPEG-4 contents

  • Cha, Kyung-Ae;Kim, Hyun-Jin
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2005.11a
    • /
    • pp.251-253
    • /
    • 2005
  • In this paper, an adaptive algorithm is proposed in streaming MPEG-4 contents with fluctuating resource amount such as throughput of network conditions. MPEG-4 is the international standard for audiovisual presentation which is composed of object based media streams. The proposed technique provides the media stream corresponding an object with multiple media streams with different qualities and bit rate in order to support object based scalability to the MPEG-4 content. In addition, making the object streams adaptable, a feasible stream set selected from the multiple streams for transmission with optimal quality in the form of the current status.

  • PDF

An Efficient Complex Event Processing Algorithm based on Multipattern Sharing for Massive Manufacturing Event Streams

  • Wang, Jianhua;Lan, Yubin;Lu, Shilei;Cheng, Lianglun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.3
    • /
    • pp.1385-1402
    • /
    • 2019
  • Quickly picking up some valuable information from massive manufacturing event stream usually faces with the problem of long detection time, high memory consumption and low detection efficiency due to its stream characteristics of large volume, high velocity, many variety and small value. Aiming to solve the problem above for the current complex event processing methods because of not sharing detection during the detecting process for massive manufacturing event streams, an efficient complex event processing method based on multipattern sharing is presented in this paper. The achievement of this paper lies that a multipattern sharing technology is successfully used to realize the quick detection of complex event for massive manufacturing event streams. Specially, in our scheme, we firstly use pattern sharing technology to merge all the same prefix, suffix, or subpattern that existed in single pattern complex event detection models into a multiple pattern complex event detection model, then we use the new detection model to realize the quick detection for complex events from massive manufacturing event streams, as a result, our scheme can effectively solve the problems above by reducing lots of redundant building, storing, searching and calculating operations with pattern sharing technology. At the end of this paper, we use some simulation experiments to prove that our proposed multiple pattern processing scheme outperforms some general processing methods in current as a whole.

An Efficient M-way Stream Join Algorithm Exploiting a Bit-vector Hash Table (비트-벡터 해시 테이블을 이용한 효율적인 다중 스트림 조인 알고리즘)

  • Kwon, Tae-Hyung;Kim, Hyeon-Gyu;Lee, Yu-Won;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.35 no.4
    • /
    • pp.297-306
    • /
    • 2008
  • MJoin is proposed as an algorithm to join multiple data streams efficiently, whose characteristics are unpredictably changed. It extends a symmetric hash join to handle multiple data streams. Whenever a tuple arrives from a remote stream source, MJoin checks whether all of hash tables have matching tuples. However, when a join involves many data streams with low join selectivity, the performance of this checking process is significantly influenced by the checking order of hash tables. In this paper, we propose a BiHT-Join algorithm which extends MJoin to conduct this checking in a constant time regardless of a join order. BiHT-Join maintains a bit-vector which represents the existence of tuples in streams and decides a successful/unsuccessful join through comparing a bit-vector. Based on the bit-vector comparison, BiHT-Join can conduct a hash join only for successful joining tuples based on this decision. Our experimental results show that the proposed BiHT-Join provides better performance than MJoin in the processing of multiple streams.

Worst Average Queueing Delay of Multiple Leaky-Bucket-Regulated Streams and Jumping-Window Regulated Stream

  • Lee, Daniel C.
    • Journal of Communications and Networks
    • /
    • v.6 no.1
    • /
    • pp.78-87
    • /
    • 2004
  • This paper presents deterministic, worst-case analysis of a queueing system whose multiple homogeneous input streams are regulated by the associated leaky buckets and the queueing system that has a single stream regulated by the jumping-window. Queueing delay averaged over all items is used for performance measure, and the worst-case input traffic and the worst-case performance are identified for both queueing systems. For the former queueing system, the analysis explores different phase relations among leaky-bucket token generations. This paper observes how the phase differences among the leaky buckets affect the worst-case queueing performance. Then, this paper relates the worst-case performance of the former queueing system with that of the latter (the single stream case, as in the aggregate streams from many users, whose item arrivals are regulated by one jumping-window). It is shown that the worst-case performance of the latter is identical to that of the former in which all leaky buckets have the same phase and have particular leaky bucket parameters.

An Analysis of Agenda-setting Process to Appoint Library Professional as the Director of National Assembly Library: Based on the Kingdon's Multiple Streams Model (국회도서관장 전문가 임명 정책 의제화 과정 분석 - Kingdon의 다중흐름모형을 적용하여 -)

  • Yeon, Jieun;Kim, Giyeong
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.51 no.3
    • /
    • pp.293-322
    • /
    • 2017
  • The purpose of the study is to identify the background of the agenda-setting to appoint library professional as the director of National Assembly Library and characteristics of the policy entrepreneur of this agenda. To this purpose an agenda-setting process in 2014 is analyzed with the Kingdon's multiple streams model. Kingdon's multiple streams model explains that an agenda is set when a window of opportunity is opened by coupling of problem stream, political stream, and policy stream. They have existed independently before setting the agenda. This study showed that the political stream was the major stream to open the window of opportunity. The lawmaker in the opposition party is identified as the leader for the agenda and the motivations, resources, and strategies of the policy entrepreneur were also analyzed. The analysis showed the agenda for library professional as the director was set without visible participation of library professionals. Therefore this study proposed the library professionals' roles for the library and information policy making process.

Additional Traffic Descriptors for Associatiove QoS Parameters in a Multimedia Service (멀티미디어 서비스에서 연관 QoS 지원을 위한 트래픽 기술자)

  • 김지영;이상목최봉근이상홍
    • Proceedings of the IEEK Conference
    • /
    • 1998.06a
    • /
    • pp.86-89
    • /
    • 1998
  • Multiple types of information in a multimedia service are delivered though multiple virtual connections on ATM network, while each virtual connection may be controlled independently. A multimedia service requires an associative relationship among multiple information streams to provide required harmonization. There may be required additional traffic descriptors to guarantee the required harmonization among multiple information streams in a multimedia service. For buffering of large bandwidth information stream(e.g., video), extremely large buffer size is necessary, but this approach should not be efficient way to compensate a severely delayed cells/blocks experienced at network. The best way to solve this problem will be minimization of relative-delayed-transfer of cells/blocks to application processes through ATM network control. To minimize a delayed transfer the mapping between relative delay parameter(i.e., associative Group QoS parameters) and per-VC traffic descriptor will be necessary. This paper is present additional functions and parameters to interpret the mapping between relative delay parameters(i.e., associative Group QoS parameters) and per-VC traffic descriptors in ATM API for multimedia application services.

  • PDF

Balanced bitrate control of multiple videos in transcoding for multi-view service

  • Gankhuyag, Ganzorig;Choe, Yoonsik
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.7 no.2
    • /
    • pp.168-172
    • /
    • 2015
  • In this paper, a balanced bitrate control in transcoding process based on video complexity measure for multi-view system which simultaneously shows multiple channels or video contents in single screen, is proposed. In order to consider the total quality of multiple video streams, the proposed algorithm reduces the complexity of multiple video stream and video quality differences at the same time by controlling bitrates of each stream by weighting when they are stitched for single screen. For the measure of complexity and quality differences between video streams, two different data: histogram of macroblock type and bitrate for each stream are used. The experimental result indicates that proposed algorithm decreases fluctuation of quality difference between videos in the multi-view system.

An Experimental Study of Backwater Effects Caused by the Covered Reach of Urban Streams

  • Yoon, Yong-Nam;Ahn, Jae-Hyun;Kim, Jin-Kwan
    • Korean Journal of Hydrosciences
    • /
    • v.8
    • /
    • pp.19-30
    • /
    • 1997
  • The hydraulics of flow within the covered reach of urban streams is very complicated due to the accumulation and interference effect of eddies around the multipli piers supporting the covering slab. An extensive experimental study is done to quantitatively estimate the backwater rise effect caused by various arrays of multiple piers. The factors governing the backwater rise are found out to be the contraction ratio due to the piers. Foude number of the flow, longitudinal pier spacing, and the length of the covered reach. For a single section of lateral pier arralyzed and a multiple regression equation derived. The effect of multiple piers, arrayed in both lateral and longitudinal directions. on the backwater rise is analyzed in terms of the contraction ratio. Froude number, longitudinal pier spacing and the total length of the covered reach. A multiple regression equation for the backwater rise estimation is proposed based on the experimental data collected in this study.

  • PDF