• Applied Science and Convergence Technology
• /
• v.24 no.1
• /
• pp.9-15
• /
• 2015

The practical pumping speed of a dry pump is considerably lower than the intrinsic speed because of back-streaming through finite gaps of the rotor assembly. The maximum compression ratio and the ultimate pressure of the pump are also directly influenced by the back-streaming rate. Therefore, information on the gap conductance, which determines the back-streaming characteristics of the rotor assembly, is the most important key for estimating the pumping performance of a dry pump. In this paper, the feasibility of calculating analytically the pumping performance of a multi-stage Roots pump, one of the most popular types of dry pumps, by quantifying the gap conductance in a rational way, is discussed.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.413-417
• /
• 2009

The use of scalable video coding scheme has been regarded as a promising solution for guaranteeing the quality of service of the video streaming over the Internet because it is a capable coding scheme to perform quality adaptation depending on network conditions. In this paper, we use a streaming model that transmits base layer using TCP and enhancement layers using DCCP, which try to provide transmission reliability of the BL and TCP friendliness. Unlike pervious works, the proposed algorithm performs rate adaptation based on playout buffer status. The PoB status of the client is sent back periodically to the server and serves as a network congestion indicator. Experimental results show that our scheme improves streaming quality comparing with pervious scheme in the case of not only constant/dynamic background flows but also VBR-encoded video sequence.

• The KIPS Transactions:PartC
• /
• v.16C no.3
• /
• pp.363-372
• /
• 2009

For large scale VOD service, cluster servers are spotlighted to their high performance and low cost. A cluster server usually consists of a front-end node and multiple back-end nodes. Though increasing the number of back-end nodes can result in the more QoS streams for clients, the possibility of failures in back-end nodes is proportionally increased. The failure causes not only the stop of all streaming service but also the loss of the current playing positions. In this paper, when a back-end node becomes a failed state, the recovery mechanisms are studied to support the unceasing streaming service. For the actual VOD service environment, we implement a cluster-based VOD servers composed of general PCs and adopt the parallel processing for MPEG movies. From the implemented VOD server, a video block recovery mechanism is designed on parity algorithms. However, without considering the architecture of cluster-based VOD server, the application of the basic technique causes the performance bottleneck of the internal network for recovery and also results in the inefficiency CPU usage of back-end nodes. To address these problems, we propose a new failure recovery mechanism based on the pipeline computing concept.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1035-1056
• /
• 2015

The efficiency of live Peer-to-Peer (P2P) streaming protocols depends on the appropriateness and the management abilities of their underlying overlay multicast. While a tree overlay structure confines transmission delays efficiently by maintaining deterministic delivery paths, an overlay mesh structure provides adequate resiliency to peers dynamics and easy maintenance. On the other hand, content freshness, playback fluidity and streaming continuity are still challenging issues that require viable solutions. In this paper, we propose a Hybrid Live P2P Streaming Protocol (HLPSP) based on a hybrid overlay multicast that integrates the efficiency of both the tree and mesh structures. Extensive simulations using OMNET++ are conducted to investigate the efficiency of HLPSP in terms of relevant performance metrics, and position HLPSP with respect to DenaCast the enhanced version of the well-known CoolStreaming protocol. Simulation results show that HLPSP outperforms DenaCast in terms of startup delay, end-to-end delay, play-back delay and data loss.

• 한국HCI학회:학술대회논문집
• /
• 2007.02c
• /
• pp.306-317
• /
• 2007

We present an interactive and accurate collision detection algorithm for deformable, polygonal objects based on the streaming computational model. Our algorithm can detect all possible pairwise primitive-level intersections between two severely deforming models at highly interactive rates. In our streaming computational model, we consider a set of axis aligned bounding boxes (AABBs) that bound each of the given deformable objects as an input stream and perform massively-parallel pairwise, overlapping tests onto the incoming streams. As a result, we are able to prevent performance stalls in the streaming pipeline that can be caused by expensive indexing mechanism required by bounding volume hierarchy-based streaming algorithms. At run-time, as the underlying models deform over time, we employ a novel, streaming algorithm to update the geometric changes in the AABB streams. Moreover, in order to get only the computed result (i.e., collision results between AABBs) without reading back the entire output streams, we propose a streaming en/decoding strategy that can be performed in a hierarchical fashion. After determining overlapped AABBs, we perform a primitive-level (e.g., triangle) intersection checking on a serial computational model such as CPUs. We implemented the entire pipeline of our algorithm using off-the-shelf graphics processors (GPUs), such as nVIDIA GeForce 7800 GTX, for streaming computations, and Intel Dual Core 3.4G processors for serial computations. We benchmarked our algorithm with different models of varying complexities, ranging from 15K up to 50K triangles, under various deformation motions, and the timings were obtained as 30~100 FPS depending on the complexity of models and their relative configurations. Finally, we made comparisons with a well-known GPU-based collision detection algorithm, CULLIDE [4] and observed about three times performance improvement over the earlier approach. We also made comparisons with a SW-based AABB culling algorithm [2] and observed about two times improvement.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.569-572
• /
• 2005

This paper proposed the design and implementation of a DSP platform for the various multimedia streaming. The DSP platform synchronizes with host PC to configure DSP and to transmit multimedia streaming through PCI. The suggested DSP platform decodes high-capacity video/audio data using the suggested high-speed FIFO, CPLD and memory interface. The buffer control techniques is proposed in other to avoid the under/over-run of the audio/video data during the audio/video decoding. For the DSP platform test, host PC transmits program stream(PS) that consists of the MPEG-2 video MP@ML and 5.1ch AC3 audio data (Coyote.mov file, half hour running time) to DSP platform. The DSP platform plays continuously back the high sound-quality audio and high-definition video at once.

• Journal of Convergence for Information Technology
• /
• v.10 no.1
• /
• pp.28-34
• /
• 2020

This paper intends to examine the recent acquisition of 21st Century Fox by Walt Disney Co. in terms of how information communication technology, especially the internet, has been reshaping the media industry. In particular, it looks at the deal as Disney's attempt to adapt to the rapidly shifting media environment and strike back at the challenges from online streaming services. After looking at the overview of the deal and some of the major changes and challenges the rise of streaming services has brought to film and media landscape, the paper looks at Disney responded to them by launching its own streaming services and how its acquisition of Fox assets factors in this. It also examines the implications of Disney's move as well as the opportunity and challenges it faces.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.51-56
• /
• 2014

Thesedays, there are many smart device applications developed, especially on the using various sensors included in the smart device. Smart devices have several sensors which are camera, GPS, mike, and communication module for collecting ubiquitous environment, and many applications are developed by using such sensors. In this paper, we developed the multimedia stream architecture and examined the smart device applications based on open source with front and back-end server clouds for developing the conceptual architecture. Also, we examined the back-end distributed servers, realtime multimedia stream transferring, multi-media store, and media relay for other server and smart devices. We test the examined architecture on the real target environment to collect the SIP initial setup time, media stream delay, and end-to-end play time. The test results show that there have good network operation environment to provide realtime multimedia services, and we need to improve the end-to-end play time by minimizing the initial setup time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.291-304
• /
• 2019

This paper proposes a dynamic-tiling-based bandwidth-efficient (DTBE) virtual reality (VR) streaming scheme. We consider 360-degree VR contents with multiple view points such as the front, back, upper, and bottom sides. At a given time, the focus of a client is always bound to a certain view among multiple view points. By utilizing this perspective, under our proposed scheme, tiles with high encoding rates are selectively assigned to the focused view where multiple view points consist of multiple tiles with different encoding rates. The other tiles with low encoding rates are assigned to the remaining view points. Furthermore, for reducing view adaptation delay, we design a novel rapid view adaptation mechanism that selectively delivers an I-frame during view point updates by using frame indexing. We implement the proposed scheme on a commercial VR test bed where we adopt the MPEG media transport (MMT) standard with high-efficiency video coding (HEVC) tile modes. The measurement-based experiments show that the proposed scheme achieves an average data usage reduction of almost 65.2% as well as average view adaptation delay reduction of almost 57.7%.

• Journal of Internet Computing and Services
• /
• v.11 no.2
• /
• pp.143-153
• /
• 2010

When providing high quality panoramic video across the Internet, mobile communications, and broadcasting areas, it requires a suitable video codec that satisfies both high-compression efficiency and random access functionality. The users must have high-compression efficiency in order to enable video streaming of high-volume panoramic data. Random access allows the user to move the viewpoint and direction freely. In this paper, we propose the parallel processing scheme under cell units in order to improve the performance of streaming service for large screen panoramic video in 10Mbps bandwidths based on H.264/AVC with high compression rate. This improved algorithm divides a screen composed of cells less than $256{\times}256$ in size, encodes it, and decodes it with the cells in the present view. At this point, encoding/decoding is parallel processed by the present cell units. Also, since the cells only included in the present view are packed and transmitted, the possible processing of not extricating blocks is proven by experiment.