• The Transactions of the Korea Information Processing Society
• /
• v.5 no.6
• /
• pp.1418-1430
• /
• 1998

Temporal databases support an efficient historical management by means of valid time and transaction time. Valid time stands for the time when a data happens in the real world. And transaction time stands for the time when a data is stored in the database, Temporal Query Processing System(TQPS) should be extended so as tc process the temporal operations for the historical informations in the user query as well as the conventional relational operations. In this paper, the extended temporal query processing systems which is based on the previous temporal query processing system for TQuel(Temporal Query Language) consists of the temporal syntax analyzer, temporal semantic analyzer, temporal code generator, and temporal interpreter is to be described, The algorithm for additional functions such as transaction time management, temporal aggregates, temporal views, temporal joins and the heuristic optimization functions and their example how to be processed is shown.

• The KIPS Transactions:PartA
• /
• v.12A no.7 s.97
• /
• pp.621-626
• /
• 2005

Recently, flash memory is widely used in various embedded applications since it has many advantages in terms of non-volatility, fast access speed, shock resistance, and low power consumption. However, it requires a software layer called FTL(Flash Translation Layer) due to its hardware characteristics. We present a new FTL algorithm named LSTAFF(Large State Transition Applied Fast flash Translation Layer) which is designed for large block flash memory The presented LSTAFF is adjusted to flash memory with pages which are larger than operating system data sector sizes and we provide performance results based on our implementation of LSTAFF and previous FTL algorithms using a flash simulator.

• The KIPS Transactions:PartB
• /
• v.9B no.4
• /
• pp.453-458
• /
• 2002

It is not easy to analyze dynamic sports motion, but it can be done easily by using an interactive playback of the recorded motion. Everybody is able to capture a golf swing owing to the popularization of PC and digital camcorder in these days. In this study, the system that can provide golf swing analysis is selected and implemented. Furthermore, editing method that can represent motion is applied and moving object tracking algorithm that can make this profess easy is applied to provide easy golf swing analysis.

• The KIPS Transactions:PartA
• /
• v.10A no.4
• /
• pp.347-356
• /
• 2003

The OCT algorithm needs efficient hardware architecture to compute inner product. The conventional methods have large hardware complexity. Because of this reason. a computation sharing multiplier was proposed for implementing inner product. However, the existing multiplier has inefficient hardware architecture in precomputer and select units. Therefore it degrades the performance of the multiplier. In this paper, we proposed a new efficient computation sharing multiplier and applied it to implementation of 1-D DCT processor. The comparison results show that the new multiplier is more efficient than an old one when hardware architectures and logic synthesis results were compared. The designed 1-D DCT processor by using the proposed multiplier is more high performance than typical design methods.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.93-105
• /
• 2006

The domination of the Internet by TCP-based services has spawned many efforts to provide high network utilization with low loss and delay in a simple and scalable manner. Active queue management (AQM) algorithms attempt to achieve these goals by regulating queues at bottleneck links to provide useful feedback to TCP sources. While many AQM algorithms have been proposed, most suffer from instability, require careful configuration of nonintuitive control parameters, or are not practical because of slow response to dynamic traffic changes. In this paper, we propose a new AQM algorithm, hybrid random early detection (HRED), that combines the more effective elements of recent algorithms with a random early detection (RED) core. HRED maps instantaneous queue length to a drop probability, automatically adjusting the slope and intercept of the mapping function to account for changes in traffic load and to keep queue length within the desired operating range. We demonstrate that straightforward selection of HRED parameters results in stable operation under steady load and rapid adaptation to changes in load. Simulation and implementation tests confirm this stability, and indicate that overall performances of HRED are substantially better than those of earlier AQM algorithms. Finally, HRED control parameters provide several intuitive approaches to trading between required memory, queue stability, and response time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1323-1328
• /
• 2011

In this paper, we have shown Dalvik virtual machine implementation to reduce the profiling overhead from the trace of the JIT compiler for the specific method. By running the same Java method on the original Dalvik VM and the modified Dalvik VM, we have achieved around 30% performance improvement with this algorithm. In this paper, to increase the reader's understanding of Android Dalvik virtual machine, we will explain the architecture of Dalvik JIT compiler and we will provide the detailed explanation with source codes for modified parts of Dalvik virtual machine. From the industry perspective, we can expect competitive benefits over the competitors with performance improvement in Android core.

• KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
• /
• v.5B no.1
• /
• pp.70-77
• /
• 2005

This paper presents sensorless speed control of a cylindrical permanent magnet synchronous motor (PMSM) using the adaptive integral binary observer. In view of the composition with a main loop regulator and an auxiliary loop regulator, the normal binary observer has the feature of chattering alleviation in the constant boundary layer. However, the steady state estimation accuracy and robustness are dependent upon the thickness of the constant boundary layer. In order to improve the steady state performance of the binary observer, a new binary observer is formed by the addition of extra integral dynamics to the existing switching hyperplane equation. Also, because the parameters of the dynamic equations such as machine inertia or viscosity friction coefficient are not well known and these values can be changed during normal operations, there are many restrictions in the actual implementation. The proposed adaptive integral binary observer applies an adaptive scheme so that the observer may overcome the problems caused by using dynamic equations. The rotor speed is constructed by using the Lyapunov function. The observer structure and its design method are described. The experimental results of the proposed algorithm are presented to prove the effectiveness of the approach.

• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.54 no.3
• /
• pp.154-161
• /
• 2005

This paper proposes a speed-sensorless induction motor control system using a rotor speed compensation. To explain the proposed system, this paper describes an induction motor model in the synchronous reference frame for the vector control. The rotor flux is estimated by the rotor flux observer using the reduced-dimensional state estimator technique. The estimated rotor speed is directly obtained from the electrical frequency, the slip frequency, and the rotor speed compensation with the estimated q-axis rotor flux. The error of the rotor time constant is indirectly reflected in the rotor speed compensation using the compensation of the flux error angle. To precisely estimate the rotor flux, the actual value of the stator resistance, whose actual variation is reflected, is derived. An implementation of pulse-width modulation (PWM) pulses using an effective space vector modulation (SVM) is briefly mentioned. For fast calculation and improved performance of the proposed algorithm, all control functions are implemented in software using a digital signal processor (DSP) with its environmental circuits. Also, it is shown through experimental results that the proposed system gives good performance for the speed-sensorless induction motor control.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.650-652
• /
• 2000

Although Fuzzy Logic Controller(FLC) adopted three terms as input gives better performance. FLC is in general composed of two-term control because of the difficulty in the construction of fuzzy rule base. In this paper, a three-term FLC which is similar to PID control but acts as a nonlinear controller is proposed. To reduce the complexity of the rule base design and increase efficiency, a simplified fuzzy PID control is induced from a hybrid velocity/position type PID algorithm by sharing a common rule base for both fuzzy Pi and fuzzy PD parts. It is simple in structure, easy in implementation, and fast in calculation. The phase plane technique is applied to obtain the rule base for fuzzy two-term control and them. The resultant rule base is Macvicar-Whelan type. The frequency response information is used in tuning of membership functions. Also a tuning strategy for the scaling factors is Proposed based on the relationship between PID gain and them. Simulation results show better performance and the effectiveness of the proposed method.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.120-122
• /
• 2006

The paper concerns the hybrid optimization of fuzzy inference systems that is based on Hierarchical Fair Competition-based Parallel Genetic Algorithms (HFCGA) and information data granulation. The granulation is realized with the aid of the Hard C-means clustering and HFCGA is a kind of multi-populations of Parallel Genetic Algorithms (PGA), and it is used for structure optimization and parameter identification of fuzzy model. It concerns the fuzzy model-related parameters such as the number of input variables to be used, a collection of specific subset of input variables, the number of membership functions, the order of polynomial, and the apexes of the membership function. In the hybrid optimization process, two general optimization mechanisms are explored. Thestructural optimization is realized via HFCGA and HCM method whereas in case of the parametric optimization we proceed with a standard least square method as well as HFCGA method as well. A comparative analysis demonstrates that the proposed algorithm is superior to the conventional methods.