• 한국전산유체공학회:학술대회논문집
• /
• 1995.10a
• /
• pp.246-252
• /
• 1995

The transient incompressible flow behind the bluffbody is numerically simulated using the random vortex method(RVM). Based on the vorticity formulation of the unsteady Navier-Stokes equations, the Lagrangian approach with the random walk technique is employed to account for the transport processes of the vortex elements. The random walk procedure for the diffusion process has been validated against the exact solutions. The present simulation focuses on the transition flow regime where the recirculation zone behind the bluffbody becomes highly unsteady and large-scale vortex eddies are shed from the bluffbody wake. The unsteady flow structures and the mixing characteristics behind the bluffbody are discussed in details.

• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2005.11a
• /
• pp.216-217
• /
• 2005

This paper presents an integrated navagation control concept for underwater vehicles under high speed navigation circumstance. First of all, in order to control an underwater vehicle with respect to automatic navigation, an integrated navigation control method is suggested in view of synchronous control for course keeping, diving and depth control. An exact nonlinear model equation with six-degree-of-freedom is derived for control algorithm. To identify various hydrodynamic coefficients of the equation, an experimental approach is introduced and results are demonstrated for MANTA type model.

• Journal of applied mathematics & informatics
• /
• v.36 no.3_4
• /
• pp.331-348
• /
• 2018

In this paper, an initial value method for solving a class of singularly perturbed delay differential equations with layer behavior is proposed. In this approach, first the given problem is modified in to an equivalent singularly perturbed problem by approximating the term containing the delay using Taylor series expansion. Then from the modified problem, two explicit Initial Value Problems which are independent of the perturbation parameter, ${\varepsilon}$, are produced: the reduced problem and boundary layer correction problem. Finally, these problems are solved analytically and combined to give an approximate asymptotic solution to the original problem. To demonstrate the efficiency and applicability of the proposed method three linear and one nonlinear test problems are considered. The effect of the delay on the layer behavior of the solution is also examined. It is observed that for very small ${\varepsilon}$ the present method approximates the exact solution very well.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.2258-2274
• /
• 2020

In this paper we first propose a new cryptosystem based on our data hiding scheme (2,9,8) introduced in 2019 with high security, where encrypting and hiding are done at once, the ciphertext does not depend on the input image size as existing hybrid techniques of cryptography and steganography. We then exploit our automata approach presented in 2019 to design two algorithms for exact and approximate pattern matching on secret data encrypted by our cryptosystem. Theoretical analyses remark that these algorithms both have O(n) time complexity in the worst case, where for the approximate algorithm, we assume that it uses ⌈(1-ε)m)⌉ processors, where ε, m and n are the error of our string similarity measure and lengths of the pattern and secret data, respectively. In searchable encryption, our cryptosystem is used by users and our pattern matching algorithms are performed by cloud providers.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.1109-1114
• /
• 1992

Modern chemical processes are becoming more complicated. The sophisticated chemical processes have needed the fault diagnosis pxpert systems that can detect and diagnose the fault diagnosis expert systems that can detect and diagnose the faults of some processes and give and advice to the operator in the event of process faults. We present the Time-Delay Neural Network(TDNN) approach for on-line fautl diagnosis. The on-line fault diagnosis system finds the exact origin of the fault of which the symptom is propagated continuously with time. The proposed method has been applied to a pilot distillation column to show the merits and applicability of the TDNN.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.432-435
• /
• 1995

In this paper a new approach to obtain the solution of the linear-quadratic Gaussian control problem for singularly perturbed discrete-time stochastic systems is proposed. The alogorithm proposed is based on exploring the previous results that the exact solution of the global discrete algebraic Riccati equations is found in terms of the reduced-order pure-slow and pure-fast nonsymmetric continuous-time algebraic Riccati equations and, in addition, the optimal global Kalman filter is decomposed into pure-slow and pure-fast local optimal filters both driven by the system measurements and the system optimal control input. It is shown that the optimal linear-quadratic Gaussian control problem for singularly perturbed linear discrete systems takes the complete decomposition and parallelism between pure-slow and pure-fast filters and controllers.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.47-50
• /
• 1995

This paper concerns an adaptive control scheme which is an extension of the simplified adaptive control. Originally, the SAC approach was developed based on the command generator tracker (CGT) theory for perfect model tracking. An attractive point of the SAC is that a control input can be synthesized without any prior knowledge about plant structure. However, a feedforward dynamic compensator of the CGT is removed from the basic structure of the SAC. This deletion of the compensator makes perfect model tracking difficult against even a step input. In this paper, an adaptive control system is redesigned to achieve perfect model tracking for as long as possible by reviving the dynamic compensator of the CGT. The proposed method is applied to slewing control of a flexible space structure and compared to the SAC responses.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.6 s.324
• /
• pp.79-86
• /
• 2004

In the integration of Sommerfeld type for space domain Green's function, a accurate closed-from Green's function method provides more exact solution than the typical complex image method and two-level method. The accurate closed-form Green's function method is applied to obtain the space domain Green's functions of planar structures with general sources. Please put the abstract of paper here.

• Bulletin of the Korean Chemical Society
• /
• v.32 no.2
• /
• pp.439-443
• /
• 2011

Using the projection operator technique, a reduced density matrix theory for linear absorption spectrum of energy transfer systems is developed for the theoretical absorption line shape of the systems with non-Condon transitions. As an application, we considered a model system of OH vibrations of water. In the present model calculation, the OH vibration modes are coupled to each other via intra-molecular coupling mechanism while their intermolecular couplings are turned off. The time-correlation functions appearing in the formulation are calculated from a mixed quantum/classical mechanics method. The present theory is successful in reproducing the exact absorption line shape. Also the present theory was improved from an existing approximate theory, time-averaged approximation approach.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.1
• /
• pp.79-84
• /
• 2009

In this paper, a best-first branch and bound algorithm based upon the bottom-up approach for the unweighted unconstrained two-dimensional cutting problem is proposed to find the optimal solution to the problem. The algorithm uses simple and effective methods to prevent constructing duplicated patterns and reduces the searching space by dividing the branched node set. It also uses a efficient bounding strategy to fathom the set of patterns. Computational results are compared with veil-known exact algorithms and demonstrate the efficiency of the proposed algorithm.