• Journal of the Korean Data and Information Science Society
• /
• v.18 no.2
• /
• pp.439-445
• /
• 2007

GVF can solve two difficulties with Snakes that are on setting initial contour and have a hard time processing into boundary concavities. But GVF takes much longer computation time than the existing Snakes because of their edge map and partial derivatives. Therefore this paper analyzed the computation time between GVF and Snakes. As a simulation result, both algorithms took almost similar computation time in simple image. In real images, GVF took about two times computation than Snakes.

• The Journal of Natural Sciences
• /
• v.7
• /
• pp.115-120
• /
• 1995

Imprecise computation has been suggested as a promising model of real-time computing in order to deal with timing constraints imposed by the environment. However, the theoretical foundation of the technique has not been fully explored. To address this, a decision-theoretic foundation of imprecise computation is proposed. The main benefit of such a treatment is that it enables the qualitative assumptions underlying imprecise computation techniques to be explicitly stated in a formal way. The theoretical foundation laid out in this paper, hence, will not only enable the justification of using imprecise computation techniques for a real-time application, but will also facilitate the development of extended techniques for more complexs real-time systems.

• Proceedings of the KIEE Conference
• /
• 1990.11a
• /
• pp.239-243
• /
• 1990

This paper presents a algorithm to improve accuracy and reliability in state estimation of contaminated bad data. The conventional algorithms for detection of bad data confront the problems of excessive memory requirements and long computation time. In order to overcome measurement compensation approach is proposed to reduce computation time and partitioned measurement error model has the advantage of remarkable reduction in computation time and memory requirements in estimated error computation. The proposed algorithm has been tested for IEEE sample systems, which shows its applicability to on-line power systems.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.40 no.2
• /
• pp.144-153
• /
• 1991

This paper presents an algorithm to improve accuracy and reliability in the state estimation of contaminated bad data. The conventional algorithms for detection of bad data have the problems of excessive memory requirements and long computation time. In order to overcome these problems, a measurement compensation approach is proposed to reduce computation time, and the partitioned measurement error model has the advantage of remarkable reduction in computation time and memory requirements in estimated error computation. The proposed algorithm has been tested for IEEE sample systems, which shows its applicability to on-line power systems.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.7 s.178
• /
• pp.1878-1884
• /
• 2000

In multibody dynamic analysis, one of the most important problems is to reduce computation times for real time simulation. In this paper, a symbolic computation method is implemented and tested for each dynamic analysis step. Applying symbolic formulations to the vehicle dynamics program AutoDyn7, the effectiveness of the symbolic computation method is verified.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.6 no.1
• /
• pp.21-29
• /
• 1998

The purpose of the present paper is to determine the time required and error tolerance limits for flight data computation. The results of statistical analysis showed that the calculator side computation required about 50 seconds for each question and wind side computation needed about 115 seconds for each question. In case of error tolerance limits, it was found that the error tolerance limit for altitude computation war 90 feet and two knots of interval was recommanded for the speed computation in calculator side, and one degree of interval for heading computation and five knots interval for speed computation in wind side.

• KEPCO Journal on Electric Power and Energy
• /
• v.8 no.2
• /
• pp.159-179
• /
• 2022

Often a network becomes complex, and multiple entities would get in charge of managing part of the whole network. An example is a utility grid. While the entire grid would go under a single utility company's responsibility, the network is often split into multiple subsections. Subsequently, each subsection would be given as the responsibility area to the corresponding sub-organization in the utility company. The issue of how to make subsystems of adequate size and minimum number of interconnections between subsystems becomes more critical, especially in real-time simulations. Because the computation capability limit of a single computation unit, regardless of whether it is a high-speed conventional CPU core or an FPGA computational engine, it comes with a maximum limit that can be completed within a given amount of execution time. The issue becomes worsened in real time simulation, in which the computation needs to be in precise synchronization with the real-world clock. When the subject of the computation allows for a longer execution time, i.e., a larger time step size, a larger portion of the network can be put on a computation unit. This translates into a larger margin of the difference between the worst and the best. In other words, even though the worst (or the largest) computational burden is orders of magnitude larger than the best (or the smallest) computational burden, all the necessary computation can still be completed within the given amount of time. However, the requirement of real-time makes the margin much smaller. In other words, the difference between the worst and the best should be as small as possible in order to ensure the even distribution of the computational load. Besides, data exchange/communication is essential in parallel computation, affecting the overall performance. However, the exchange of data takes time. Therefore, the corresponding consideration needs to be with the computational load distribution among multiple calculation units. If it turns out in a satisfactory way, such distribution will raise the possibility of completing the necessary computation in a given amount of time, which might come down in the level of microsecond order. This paper presents an effective way to split a given electrical network, according to multiple criteria, for the purpose of distributing the entire computational load into a set of even (or close to even) sized computational loads. Based on the proposed system splitting method, heavy computation burdens of large-scale electrical networks can be distributed to multiple calculation units, such as an RTDS real time simulator, achieving either more efficient usage of the calculation units, a reduction of the necessary size of the simulation time step, or both.

• Journal of Power Electronics
• /
• v.10 no.6
• /
• pp.739-748
• /
• 2010

The increased integration of fuel cells with power electronics, critical loads, and control systems has prompted recent interest in accurate electrical terminal models of the polymer electrolyte membrane (PEM) fuel cell. Advancement in computing technologies, particularly parallel computation techniques and various real-time simulation tools have allowed the prototyping of novel apparatus to be investigated in a virtual system under a wide range of realistic conditions repeatedly, safely, and economically. This paper builds upon both advancements and provides a means of optimized model construction boosting computation speeds for a fuel cell model on a real-time simulator which can be used in a power hardware-in-the-loop (PHIL) application. Significant improvement in computation time has been achieved. The effectiveness of the proposed model developed on Opal RT's RT-Lab Matlab/Simulink based real-time engineering simulator is verified using experimental results from a Ballard Nexa fuel cell system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.878-894
• /
• 2013

Secure multimedia multicast applications involve group communications where group membership requires secured dynamic key generation and updating operations. Such operations usually consume high computation time and therefore designing a key distribution protocol with reduced computation time is necessary for multicast applications. In this paper, we propose a new key distribution protocol that focuses on two aspects. The first one aims at the reduction of computation complexity by performing lesser numbers of multiplication operations using a ternary-tree approach during key updating. Moreover, it aims to optimize the number of multiplication operations by using the existing Karatsuba divide and conquer approach for fast multiplication. The second aspect aims at reducing the amount of information communicated to the group members during the update operations in the key content. The proposed algorithm has been evaluated based on computation and communication complexity and a comparative performance analysis of various key distribution protocols is provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication time significantly.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.1
• /
• pp.127-133
• /
• 2003

This paper proposes a new numerical method to check the stability of a general class of time delay systems. The proposed method checks whether there are characteristic roots whose real values are nonnegative through two steps. Firstly, rectangular bounds of characteristic roots whose real values are nonnegative are computed. Secondly, the existence of roots inside the bounds are checked using the numerical computation of argument principles. An adaptive discretization is proposed for the numerical computation of argument principles.