• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.355-358
• /
• 1996

The primary objective of guidance system is to generate suitable commands so that the pursuer comes closer to its target. It is necessary, however, in the guidance of a certain pursuer that the attitude angle at impact should be within a prescribed range in addition to specification on the miss distance. These guidance requirements can not be satisfied by the general guidance laws developed for miss distance minimization. Compared with the demand in many applications, the guidance laws dealing with impact attitude angle constraint are not easily found. In this paper, biased PNG laws are proposed to obtain the guidance purposes. By Lyapunov method, it is shown that the pursuer can intercept the target with a prescribed attitude angle under the assumption that the pursuer is sufficiently fast and the target maneuver is negligible. The simulation results are presented to demonstrate the performance of the suggested guidance laws.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.10
• /
• pp.543-552
• /
• 2004

This paper proposes an energy optimization technique for latency and quality constrained video applications. It consists of two key techniques: frame-skipping technique and buffering technique. While buffering increases the slack time utilization at the OS level. frame skipping Increases the slack time itself at the application level, and both enhance the effectiveness of the dynamic voltage scaling technique. We use an H.263 encoder application as a test vehicle to which the proposed technique is applied. Experiments demonstrate that the proposed technique achieves noticeable energy reduction satisfying the given latency and video quality constraints.

• Proceedings of the KSRS Conference
• /
• 2007.10a
• /
• pp.105-108
• /
• 2007

The COMS LRIT/HRIT broadcast service should satisfy the 15 minutes timeliness requirement. The timeliness requirement is an important enough to impact on the overall performance of LHGS. Therefore, the simulation for the LHGS processing was performed with the LHGS prototype in this paper. First, processing time is measured for each process (per modules) of the LHGS without I/O time. Then, the LHGS processing is performed with worst scenario and the processing time is measured. Finally, analyses for processing time and time constraint are performed.

• Journal of KIISE:Software and Applications
• /
• v.37 no.7
• /
• pp.584-589
• /
• 2010

The dynamic time warping algorithm generally used in time series pattern recognition spends most of the time in generating the correlation table, and it establishes the global path constraint to reduce the corresponding time complexity. However, the constraint restrains just in terms of the time axis, not considering the contents of input patterns. In this paper, we therefore propose an efficient branch and bound dynamic time warping algorithm which sets the global constraints by adaptively reflecting the patterns. The experimental results show that the proposed method outperforms conventional methods in terms of the speed and accuracy.

• Journal of KIISE:Software and Applications
• /
• v.28 no.12
• /
• pp.921-929
• /
• 2001

OCL was used in the UML Semantics document to specify the well-formedness rules of the UML metarmodel. UML was extended to apply it to system developments of several fields, for example real-time UML and web applications with UML. In particular the dependability is important in designing and building hard real-time system. Thus OCL is needed to express real-time UML formally and so it must extended. In this paper, we extend OCL to define event-driven real-time OCL to the development of Nrcl simulator.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.3 no.1
• /
• pp.18-22
• /
• 2003

The new realtime applications like multimedia and realtime services in a wireless network will be dramatically increased. However, many realtime services of mobile hosts in a cell cannot be continued because of insufficiency of useful channels. Conventional channel assignment approaches didn't properly consider the problem to serve realtime applications in a cell. This paper proposes a new realtime channel assignment algorithm based on time constraint analysis of channel requests. The proposed algorithm dynamically borrows available channels from neighboring cells. It also supports a smooth handoff which continuously serves realtime applications of the mobile hosts.

• Journal of Mechanical Science and Technology
• /
• v.20 no.3
• /
• pp.376-381
• /
• 2006

In this paper, the quaternion, the dual Euler, and the direction cosine methods are numerically compared using a non-aerodynamic 6 degree-of-freedom rigid model at all-attitude angles of an aircraft. The dual Euler method turns out to be superior to the others in the applications because it shows better numerical accuracy, stability, and robustness in integration step sizes. The dual Euler method is affordably less efficient than the quaternion method in terms of computational cost. Numerical accuracy and stability, which allow larger integration step sizes, are more critical in modern real-time applications than computational efficiency because of today's increased computational power. If the quaternion method is required because of constraints in computation time, then a suppression mechanism should be provided for algebraic constraint errors which will eventually add computational burden.

• Journal of the Korea Computer Industry Society
• /
• v.7 no.4
• /
• pp.309-320
• /
• 2006

The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et al suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. In the online scheduling, NORA algorithm can find a schedule with the minimum total error for the imprecise online task system. In the NORA algorithm, the EDF strategy is adopted in the optional scheduling.<중략> The algorithm, proposed in this paper, can be applied to some applications efficiently such as radar tracking, image processing, missile control and so on.

• KNOM Review
• /
• v.22 no.3
• /
• pp.25-30
• /
• 2019

For meteorological applications, meaningful results must be derived and provided within time and resource limits. Forecasts through numerous historical data are time-consuming and still have resource limitations in the case of disaster safety-related analyses/predictions such as local typhoon forecasts. Suitable forecasts should be provided without any problems caused by limited physical environmental conditions and when results are to be drawn under time constraints, such as typhoon forecasts and forecast services for flooded areas by road. In this paper, we analyze the application of weather and climate forecasting to provide a suitable forecasting service in both temporal and resource conditions. Through the analysis of execution time according to mesh sizes, it was confirmed that a mesh adjustment can cope with the case of the temporal constraint. In addition, by analyzing the execution time through memory resource control, we confirmed the minimum resource condition that does not affect the performance and the resource usage pattern of the application through the swap and mlock analysis.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.4
• /
• pp.180-187
• /
• 2002

Many real-time multimedia applications, such as video conferencing have stringent end-to-end delay constraints and consume large amount of network resources. In order to support these applications efficiently, multicast routing algorithms computing least cost multicast trees that satisfy a given end-to-end delay constraint are needed. However, finding such a tree is known to be computationally expensive. Therefore, we propose a heuristic distributed multicast routing algorithm that reduces a “finding multicast tree”that satisfies a given end-to-end delay constraint and minimizes the average resulting tree cost. Also, simulation results show that the proposed algorithm has much better average cost performance than other existing algorithms.