• 한국전산유체공학회:학술대회논문집
• /
• 2008.03a
• /
• pp.1-13
• /
• 2008

An efficient segregated algorithm for the coupling of velocity and pressure of incompressible fluid flow, called IDEAL Inner Doubly-Iterative Efficient Algorithm for Linked-Equations), has been proposed by the present authors. In the algorithm there exist double inner iterative processes for pressure equation at each iteration level, which almost completely overcome two approximations in SIMPLE algorithm. Thus the coupling between velocity and pressure is fully guaranteed, greatly enhancing the convergence rate and stability of solution process. The performance of the IDEAL algorithm for three-dimensional incompressible fluid flow and heat transfer problems is analyzed and a systemic comparison is made between the algorithm and three other most widely-used algorithms (SIMPLER, SIMPLEC and PISO). It is found that the IDEAL algorithm is the most robust and the most efficient one among the four algorithms compared. This new algorithm is used for the velocity prediction of a new interface capturing method. VOSET, also proposed by the present author. It is found that the combination of VOSET and IDEAL can appreciably enhance both the interface capture accuracy and convergence rate of computations.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.10a
• /
• pp.1-13
• /
• 2008

An efficient segregated algorithm for the coupling of velocity and pressure of incompressible fluid flow, called IDEAL (Inner Doubly-Iterative Efficient Algorithm for Linked-Equations), has been proposed by the present authors. In the algorithm there exist double inner iterative processes for pressure equation at each iteration level, which almost completely overcome two approximations in SIMPLE algorithm. Thus the coupling between velocity and pressure is fully guaranteed, greatly enhancing the convergence rate and stability of solution process. The performance of the IDEAL algorithm for three-dimensional incompressible fluid flow and heat transfer problems is analyzed and a systemic comparison is made between the algorithm and three other most widely-used algorithms (SIMPLER, SIMPLEC and PISO). It is found that the IDEAL algorithm is the most robust and the most efficient one among the four algorithms compared. This new algorithm is used for the velocity prediction of a new interface capturing method -VOSET, also proposed by the present author. It is found that the combination of VOSET and IDEAL can appreciably enhance both the interface capture accuracy and convergence rate of computations.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.5 no.2 s.10
• /
• pp.11-18
• /
• 2006

In this paper, we present the algorithm for calculating the interference of the received Non-ideal receiver filter and present the method for calculating the interference faster than that of the conventional method. The algorithm is simulated by Matlab and the simulation procedure is described by the flow-chart. The algorithm is verified by comparing the simulated results by Matlab with the result by calculator.

• Journal of Power Electronics
• /
• v.17 no.6
• /
• pp.1637-1649
• /
• 2017

This paper describes an intensive analysis of a harmonic identification algorithm in non-ideal voltages source systems. The dq-axis Fourier with a positive sequence voltage detector (DQFP) is a novel harmonic identification algorithm for active power filters. A compensating current control system based on repetitive control is presented. A design and stability analysis of the proposed current control are also given. The aim of the paper is to achieve a robustness of the harmonic identification in a distorted and unbalanced voltage source. The proposed ideas are supported by a hardware in the loop technique based on a $eZdsp^{TM}$ F28335 and the Simulink program. The obtained results are presented to demonstrate the performance of the harmonic identification and the control strategy for the active power filter in non-ideal systems.

• Honam Mathematical Journal
• /
• v.28 no.2
• /
• pp.185-196
• /
• 2006

A scheme based on the cryptography for enforcing multilevel security in a system where hierarchy is represented by a partially ordered set was first introduced by Akl et al. But the key generation algorithm of Akl et al. is infeasible when there is a large number of users. In 1985, MacKinnon et al. proposed a paper containing a condition which prevents cooperative attacks and optimizes the assignment in order to overcome this shortage. In 2005, Kim et al. proposed key management systems for multilevel security using one-way hash function, RSA algorithm, Poset dimension and Clifford semigroup in the context of modern cryptography. In particular, the key management system using Clifford semigroup of imaginary quadratic non-maximal orders is based on the fact that the computation of a key ideal $K_0$ from an ideal $EK_0$ seems to be difficult unless E is equivalent to O. We, in this paper, show that computing preimages under the bonding homomorphism is not difficult, and that the multilevel cryptosystem based on the Clifford semigroup is insecure and improper to the key management system.

• Computers and Concrete
• /
• v.10 no.1
• /
• pp.19-33
• /
• 2012

The performance of a concrete is significantly influenced by its mixture proportion and the coating thickness on aggregate surface. The concrete in this study is designed by estimating the blending ratio of aggregate using a densified mixture design algorithm (DMDA) based on an ideal grading curve and estimating the paste volume as the sum of the amount of paste needed to provide an assigned coating paste thickness. So as to obtain appropriate concrete amount, and thus can accurately estimate the property of concrete. Deduction of this mix design formula is simple and easy understanding, and meanwhile to obtain result is fast. This estimation model of mix design is expected to reward to industry and effectively upgrade concrete quality.

• Nuclear Engineering and Technology
• /
• v.44 no.7
• /
• pp.755-766
• /
• 2012

A Binary Decision Diagram (BDD) is a graph-based data structure that calculates an exact top event probability (TEP). It has been a very difficult task to develop an efficient BDD algorithm that can solve a large problem since its memory consumption is very high. Recently, in order to solve a large reliability problem within limited computational resources, Jung presented an efficient method to maintain a small BDD size by a BDD truncation during a BDD calculation. In this paper, it is first identified that Jung's BDD truncation algorithm can be improved for a more practical use. Then, a more efficient truncation algorithm is proposed in this paper, which can generate truncated BDD with smaller size and approximate TEP with smaller truncation error. Empirical results showed this new algorithm uses slightly less running time and slightly more storage usage than Jung's algorithm. It was also found, that designing a truncation algorithm with ideal features for every possible fault tree is very difficult, if not impossible. The so-called ideal features of this paper would be that with the decrease of truncation limits, the size of truncated BDD converges to the size of exact BDD, but should never be larger than exact BDD.

• Journal of Korea Society of Industrial Information Systems
• /
• v.18 no.3
• /
• pp.17-26
• /
• 2013

We have developed an ideal functionality for security requirement of functional encryption schemes. The functionality is needed when we want to show the security of a functional encryption scheme in universal composable (UC) framework. A functionality $F_{fe}$ was developed to represent ideal respond of a functional encryption scheme against any polynomial time active attacker. We show that UC security notion of functional encryption scheme $F_{fe}$ is as strong as fully secure functional encryption in an indistinguishable game with chosen cipher text attack. The proof used a method that showing for any environment algorithm, it can not distinguish ideal world where the attacker play with ideal functionality $F_{fe}$ and real world where the attacker play a fully secure functional encryption scheme.

• Proceedings of the IEEK Conference
• /
• 2001.06b
• /
• pp.329-332
• /
• 2001

This paper proposes a capacitance extraction algorithm based on boundary element method and describes the implemented 2-dimension extractor based on the proposed algorithm. The proposed algorithm uses a generalized conjugate residual iterative algorithm with a hierarchical subdivision. The implemented 2-D extractor computes the capacitances of complicated 2-D geometry of ideal conductors in uniform dielectric and can be efficiently used in the VLSI layout designs due to its user-friendly GUI.

• Proceedings of the Korea Institute of Applied Superconductivity and Cryogenics Conference
• /
• 2002.02a
• /
• pp.334-336
• /
• 2002

This study is concerned with the operation algorithm and power switch drive circuit for DC Reactor Type High-Tc Superconducting Fault Current Limiter (SFCL). In the case of SFCL, Power switching operation algorithm are very important problem. So, this driving will determine the performance of SFCL. In this paper, we provide a simple algorithm and easy drive circuit. Through experiment we found that ideal is right.