• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.1
• /
• pp.13-24
• /
• 2003

MPEG-4 is a standard for multimedia applications and provides a set of technologies to satisfy the needs of authors, service providers and end users alike. In this paper, we suggest a Real-time Multiple Circular Buffer (M4RM Buffer) model, which is suitable for streaming these MPEG-4 contents efficiently. M4RM buffer generates each structure of the buffer, which matches well with each object composing an MPEG-4 content, according to the transferred information, and manipulates multiple read/write operations only by its reference. It divides the decoder buffer and the composition buffer, which are described in the standard, by the unit of frame allocated to minimize the range of access. This buffer unit of a frame is allocated according to the object description. Also, it processes the objects synchronization within the buffer and provides APIs for an efficient buffer management to process the real-time user events. Based on the performance evaluation, we show that M4RM buffer model decreases the waiting time in a buffer frame, and so allows the real-time streaming of an MPEG-4 content using the smaller size of the memory block than IM1-2D and Window Media Player.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.5
• /
• pp.1693-1701
• /
• 2010

In this paper, requirements of efficient group key creation in multiple hierarchy structure environment with clear distinction of hierarchical roles within organizations are explained and the method of creating a group key that satisfies such requirements is proposed. The proposed method creates the group key through logical sum operation of hierarchy identifier created using uni-directional hash chain and group identifier randomly created according to the access right. The problem of excessive possession of key information by upper group users in the existing static group key creation technique was resolved. At the same time, lower group users were prevented from deducing key information of upper group users. In addition, as a result of comparative analysis performed with an experiment on existing super group key creation technique and multiple hierarchy group key method, the proposed method was found to be equivalent or superior to existing method in terms of various items including the total number of keys created, the number of keys possessed by users, the number of keys used for encoding and decoding of information, and expandability of keys.

• Journal of Broadcast Engineering
• /
• v.13 no.5
• /
• pp.622-635
• /
• 2008

Recently, high definition media services like HDTV and IPTV are growing. A fast reduced-size image extracting method is required to meet what those services require. Conventional DC image extracting methods, however, can't be applied to H.264/AVC streams since a spatial domain prediction scheme is adopted in H.264/AVC intra mode. To solve this problem, a thumbnail extraction method in H.264/AVC was proposed. However, the method has mismatch problem which was caused by round-off operation in intra prediction and mismatch between integer and floating point calculation. In this paper, we propose an error compensation method for extracting thumbnail directly in H.264/AVC bitstreams. The compensation method introduces the mismatch problem in thumbnail extraction and presents compensation values. Through the implementation and performance evaluation, proposed method compensated round-off error efficiently in D1 and HD sequences while the additional extraction time is negligible.

• Journal of the Society of Naval Architects of Korea
• /
• v.30 no.1
• /
• pp.125-133
• /
• 1993

Most studies on the vibration analysis of a beam-column with ends elastically restrained and various intermediate constraints have been based on the Euler beam theory, which is inadequate for beam-columns of low slenderness ratios. In this paper, analytical methods for vibration and dynamic sensitivity of a Timoshenko beam-column with ends elastically restrained and various intermediate constraints are presented. Firstly, an exact solution method is shown. Since the exact method requires considerable computational effort, a Rayleigh-Ritz analysis is also investigated. In the latter two kinds of trial functions are examined for comparisions : eigenfunctions of the base system(the system without intermediate constraints) and polynomials having properties corresponding to the eigenfunctions of the base system. The results of some numerical Investigations show that the Rayleigh-Ritz analysis using the characteristic polynomials is competitive with the exact solutions in accuracy, and that it is much more efficient in computations than using the eigenfunctions of the base system, especially in the dynamic sensitivity analysis. In addition, the prediction of the changes of natural frequencies due to the changes of design variables based on the first order sensitivity is in good agreements with that by the ordinary reanalysis as long as the changes of design variables are moderate.

• The KIPS Transactions:PartD
• /
• v.10D no.6
• /
• pp.935-948
• /
• 2003

An online scaling method adds new nodes to the shared-nothing database cluster and makes tables be reorganized while the system is running. The objective is to share the workload with many nodes and increase the capacity of cluster systems. The existing online scaling method, however, has two problems. One is the degradation of response time and transactions throughput due to the additional overheads of data transfer and replica's condidtency. The other is and inefficient recovery mechanism in which the overall scaling transaction is aborted by a fault. These problems deteriorate the availability of shared-nothing database cluster. To avoid the additional overheads throughout the scaling period, our scalingmethod consists of twophases : a parallel data transfer phase and a combination phase. The parallel data transferred datausing reduces the size of data transfer by dividing the data into the number of replicas. The combination phase combines the transferred datausing resources of spare nodes. Also, our method reduces the possibility of failure throughout the scaling period and improves the availability of the database cluster.

• Journal of Korean Society for Geospatial Information Science
• /
• v.1 no.1 s.1
• /
• pp.141-152
• /
• 1993

This study aims to generate digital elevation model from digital satellite imagery. Digital elevation model is being increasingly used for geo-spatial information system database development and for digital map production. Image matching technique was applied to acquire conjugate image coordinates and the algorithm for digital elevation model generation is presented in this study The exterior orientation parameters of the satellite imagery is determined by bundle adjustment and standard correlation was applied for image matching conjugate of image points. The window as well as the searching area have to be defined in image matching. Different sizes of searching area were tested to study the appropriate size of the searching area. Various coordinate transformation methods were applied to improve the computation speed as well as the geometric accuracy. The results were then statistically analysed after which the searching area is determined with the safety factor. To evaluate the accuracy of digital elevation model, 3-D coordinates were extracted from 1/5000 scale topographic map and this was compared to the digital elevation model generated from satellite imagery. The algorithm for generation of digital elevation model generated from satellite imagery is presented in this study which will prove effective in the database development of geo-spatial information system and in digital elevation modelling of large areas.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.4 s.304
• /
• pp.167-176
• /
• 2005

This paper proposes a new power minimization technique for the frame-based multimedia signal processing. The derivation of the technique is based on the newly proposed microscopic DVS(Dynamic Voltage Scaling) method, where, the operating frequency and the supply voltage levels are dynamically controlled according to the processing requirement for each frame of multimedia data. The multimedia signal processing algorithms are also redesigned and optimized to maximize the power saving efficiency of the microscopic DVS technology. The characterization of the mean/variance distribution of the processing load in the frame-based multimedia signal processing provides the major basis not only for the optimized application of the microscopic DVS technology but also for the optimization of the multimedia algorithms. The power saying efficiency of the proposed DVS approach is experimentally tested with the algorithms of MPEG-2 video decoder and MPEG-2 AAC audio encoder on the ARM9 RISC processor. The experimental results with the diverse MPEG-2 video and audio files show The average power saving efficiencies of 50$\%$ and 30$\%$, respectively. The results also agree very well with those of the analytic derivations.

• The KIPS Transactions:PartA
• /
• v.14A no.4
• /
• pp.191-196
• /
• 2007

In the field of computer graphics, Navier-Stokes equations would be used for realistic simulations of smokes and currents. However, implementations derived from these equations are hard to achieve for real-time simulations, mainly due to its massive and complex calculations. Thus, there have been various attempts to approximate these equations for real-time simulation of smokes and others. When the advection terms of the equations are approximated by the Semi-Lagrange methods, the fluid density can be rapidly reduced and small-scale vorticity phenomena are easy to be missed, mainly due to the numerical losses over time. In this paper, we propose an improved numerical method to approximately calculate the advection terms, and thus eliminate these problems. To calculate the advection terms, our method starts to set critical regions around the target grid points. Then, among the grid points in a specific critical region, we search for a grid point which will be advected to the target grid point, and use the velocity of this grid point as its advection vector. This method would reduce the numerical losses in the calculation of densities and vorticity phenomena, and finally can implement more realistic smoke simulations. We also improve the overall efficiency of vector calculations and related operations through GPU-based implementation techniques, and thus finally achieve the real-time simulation.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.5
• /
• pp.436-442
• /
• 2020

ESS(energy storage system) has recently become an important power source in various areas due to increased renewable energy resources. The more ESS is used, the less the effective capacity of the ESS. Therefore, it is important to manage the remaining useful lifetime(RUL). RUL can be checked regularly by inspectors, but it is common to be monitored and estimated by an automated monitoring system. The accurate state estimation is important to ESS operator for economical and efficient operation. RUL estimation model usually requires complex mathematical calculations consisting of cycle aging and calendar aging that are caused by the operation frequency and over time, respectively. A lightweight RUL estimation model is required to be embedded in low-performance processors that are installed on ESS. In this paper, a lightweight ESS RUL estimation model is proposed to operate on low-performance micro-processors. The simulation results show less than 1% errors compared to the original RUL model case. In addition, a performance analysis is conducted based on ATmega 328. The results show 76.8 to 78.3 % of computational time reduction.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.563-577
• /
• 2006

A stream processor uses resource sharing method for efficient of limited resource in multiple continuous queries. The previous methods process aggregate queries to consist the level structure. So insert operation needs to reconstruct cost of the level structure. Also a search operation needs to search cost of aggregation information in each size of sliding windows. Therefore this paper uses linear structure for optimization of sliding window aggregations. The method comprises of making decision, generation and deletion of panes in sequence. The decision phase determines optimum pane size for holding accurate aggregate information. The generation phase stores aggregate information of data per pane from stream buffer. At the deletion phase, panes are deleted that are no longer used. The proposed method uses resources less than the method where level structures were used as data structures as it uses linear data format. The input cost of aggregate information is saved by calculating only pane size of data though numerous stream data is arrived, and the search cost of aggregate information is also saved by linear searching though those sliding window size is different each other. In experiment, the proposed method has low usage of memory and the speed of query processing is increased.