• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.4
• /
• pp.1624-1647
• /
• 2020

Vehicular network is one of the most important subjects for researchers in recent years. Anycast routing protocols have many applications in vehicular ad hoc networks. The aim of an anycast protocol is sending packets to at least one of the receivers among candidate receivers. Studies done on anycast protocols over vehicular networks, however, have capability of implementation on some applications; they are partial, and application specific. No need to say that the lack of a comprehensive study, having a strong analytical background, is felt. Mathematical modeling in vehicular networks is difficult because the topology of these networks is dynamic. In this paper, it has been demonstrated that vehicular networks can be modeled based on time-expanded networks. The focus of this article is on geographical anycast. Three different scenarios were proposed including sending geographic anycast packet to exactly-one-destination, to at-least-one-destination, and to K-anycast destination, which can cover important applications of geographical anycast routing protocols. As the proposed model is of MILP type, a decentralized heuristic algorithm was presented. The evaluation process of this study includes the production of numerical results by Branch and Bound algorithm in general algebraic modeling system (GAMS) software and simulation of the proposed protocol in OMNET++ simulator. The comprehension of the result of proposed protocol and model shows that the applicability of this proposed protocol and its reactive conformity with the presented models based on presented metrics.

• 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.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.20 no.6
• /
• pp.83-91
• /
• 2012

In recent days, the study on hybridization of the heavy-duty is going on, actively. Especially, the improvement of fuel economy can be maximized in the intra-city bus because it drives the fixed route. For developing the hybrid electric intra-city bus, optimized control strategy which is possible to be applied with real vehicle is necessary. If the real-time control strategy is developed based on the HILS, it is possible to verify the real-time ability and fail-safety function which has the vehicle stay in safe state when the functional errors are occurred. In this study, the HILS system of series hybrid electric intra-city bus is developed to verify the real time control strategy and the fail-safety functions. The main objective of the paper is to build the HILS system for verifying the control strategy (rule-based control) which is implemented to reflect the Dynamic Programming results and fail-safety functions.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.27 no.1
• /
• pp.693-700
• /
• 2009

For real-time precise GPS data processing such as a long baseline network RTK (Real-Time Kinematic) survey, PPP (Precise Point Positioning) and monitoring of ionospheric/tropospheric delays, it is necessary to guarantee accuracy comparable to IGS (International GNSS Service) precise orbit with no latency. As a preliminary study for determining near real-time satellite orbits, the general procedures of satellite orbit determination, especially the dynamic approach, were studied. In addition, the transformation between terrestrial and inertial reference frames was tested to integrate acceleration. The IAU 1976/1980 precession/nutation model showed a consistency of 0.05 mas with IAU 2000A model. Since the IAU 2000A model has a large number of nutation components, it took more time to compute the transformation matrix. The classical method with IAU 2000A model was two times faster than the NRO (non-rotating origin) approach, while there is no practical difference between two transformation matrices.

• The Journal of the Korea Contents Association
• /
• v.6 no.7
• /
• pp.58-68
• /
• 2006

There are two traditional scheduling methods known as PQ and WRR in the DiffServ network, however, these two scheduling methods have some drawbacks. In this paper, we propose an algorithm that can be adopted in WRR scheduler with making up for weak points of PQ and WRR. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class. To evaluate the performance of the proposed algorithm, We accomplished a computer simulation using NS-2. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

• Journal of Internet Computing and Services
• /
• v.6 no.1
• /
• pp.105-114
• /
• 2005

This paper describes a new measuring technique by analysing multiple time-series patterns. This paper's goal is that extracts a really measured value having a sample pattern which is the best matched with an inputted time-series, and calculates a difference ratio with the value. Therefore, the proposed technique is not a recognition but a measurement. and not a hardware but a software. The proposed technique is consisted of three stages, initialization, learning and measurement. In the initialization stage, it decides weights of all parameters using importance given by an operator. In the learning stage, it classifies sample patterns using LBG and DTW algorithm, and then creates code sequences for all the patterns. In the measurement stage, it creates a code sequence for an inputted time-series pattern, finds samples having the same code sequence by hashing, and then selects the best matched sample. Finally it outputs the really measured value with the sample and the difference ratio. For the purpose of performance evaluation, we tested on multiple time-series patterns obtained from etching machine which is a semiconductor manufacturing.

• Journal of Korea Multimedia Society
• /
• v.14 no.1
• /
• pp.24-32
• /
• 2011

In ubiquitous environment, the analysis for student's learning behaviour is essential to provide students with personalized education. SCORM(Sharable Contents Object Reference Model), IMS LD (Instructional Management System Learning Design) standards provide the support function of learning design such as checking the progress. However, in case of applying these standards contain many problem to add or modify the contents. In this paper, We implement the system that manages the learner behaviour by hooking the event of web browser. Through all of this, HTML-based content can be recycled without any additional works and the problems by applying the standard can be improved because the store and analysis of the learning result is possible. It also supports the ubiquitous learning environment because of keeping track of the learning result in case of network disconnected.

• Journal of Korea Multimedia Society
• /
• v.11 no.3
• /
• pp.301-314
• /
• 2008

The existing event recognition is accomplished with the limited systematic foundation, and thus much longer learning time is needed for emergency scenario interpretation due to large scale of probability data. In this paper, we propose a method for nile-based event recognition of an independent object(human) which extract a feature vectors from the object and analyze the behavior pattern of each object and interpretation of emergency scenarios using a probability and object's events. The event rule of an independent object is composed of the Primary-event, Move-event, Interaction-event, and 'FALL DOWN' event and is defined through feature vectors of the object and the segmented motion orientated vector (SMOV) in which the dynamic Bayesian network is applied. The emergency scenario is analyzed using current state of an event and its post probability. In this paper, we define diversified events compared to that of pre-existing method and thus make it easy to expand by increasing independence of each events. Accordingly, semantics information, which is impossible to be gained through an.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.531-538
• /
• 2008

With the dynamic and mobile nature of ad hoc networks, links may fail due to topology changes. So, a major challenge in ad hoc network is dynamically to search paths from a source to destination with an efficient routing method, which is an important issue for delay-sensitive real-time application. The main concerns of graph theory in communications are finding connectivity and searching paths using given nodes. A topology of the nodes in ad hoc networks can be modeled as an adjacency matrix. In this paper, based on this adjacency matrix, we propose new path search algorithms using a sequence of matrix calculation. The proposed algorithms can search paths from a destination to a source using connectivity matrix. Two matrix-based algorithms for two different purposes are proposed. Matrix-Based Backward Path Search(MBBS) algorithm is designed for shortest path discovery and Matrix-Based Backward Multipath Search(MBBMS) algorithm is for multipath search.