• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.10 s.241
• /
• pp.1369-1376
• /
• 2005

In structural design, the design variables are frequently selected from certain discrete values. Various optimization algorithms have been developed fDr discrete design. It is well known that many function evaluations are needed in such optimization. Recently, sequential algorithm with orthogonal arrays (SOA), which is a search algorithm for a local minimum in a discrete space, has been developed. It considerably reduces the number of function evaluations. However, it only finds a local minimum and the final solution depends on the initial values of the design variables. A new algorithm is proposed to adopt a genetic algorithm (GA) in SOA. The GA can find a solution in a global sense. The solution from the GA is used as the initial design of SOA. A sequential usage of the GA and SOA is carried out in an iterative manner until the convergence criteria are satisfied. The performance of the algorithm is evaluated by various examples.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.331-336
• /
• 2005

A lot of manufacturing knowledge and method have applied to increase manufacturing efficiency in industry field. DES(Discrete Event Simulation) is one of solution to deal with manufacturing problems in factory. Beginning of research, old maintenance system of KNR ( Korea National Railroad) and its technical problems are basically investigated. KNR has maintained railway vehicle with their own solution based on experience. Very advanced railway vehicles such as KTX (Korea Train Express) and TTX(Tilting Train Express) will be difficult to maintain with their old maintenance method. In order to apply knowledge of DES, maintenance field of railway must be considered. Imaginary maintenance machine are selected to variable of DES. Maintenance capability of each machine will be evaluated base on imaginary data from imaginary machine. The machine could be very expensive as well as difficult to replace. Target of research is minimization of number of machine in railway workshop. So basic knowledge of discrete event simulation is introduced. Then five essential stages of discrete event simulation are provided. Each maintenance case defined as event. Each event is discrete and simulated base on different case such as one maintenance line with one machine and one maintenance line with two machines in railway workshop. simple maintenance method, discrete event simulation, will be come out very powerful in complicate maintenance system and will be helpful to reduce maintenance cost as well as maintenance labor.

• Journal of Energy Engineering
• /
• v.15 no.4 s.48
• /
• pp.250-255
• /
• 2006

In this study, the discrete ordinates method which has been widely used in the solution of neutron transport equation is applied to the solution of the time dependent radiative transfer equation. The self-adjoint form of the second order radiation intensity equation is used to enhance the stability of the solution, and a new multi-step linearization method is developed to avoid the nonlinearity in the material temperature equation. This new solution method is applied to the well known Marshak wave problem, and the numerical result is compared with that of the conventional Monte-Carlo method.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.3
• /
• pp.63-70
• /
• 2013

Many real world optimization problems are discrete and multi-valued. Meta heuristics including Genetic Algorithm and Particle Swarm Optimization have been effectively used to solve these multi-valued optimization problems. However, extensive comparative study on the performance of these algorithms is still required. In this study, performance of these algorithms is evaluated with multi-modal and multi-dimensional test functions. From the experimental results, it is shown that Discrete Particle Swarm Optimization (DPSO) provides better and more reliable solutions among the considered algorithms. Also, additional experiments shows that solution quality of DPSO is not lowered significantly when bit size representing a solution increases. It means that bit representation of multi-valued discrete numbers provides reliable solutions instead of becoming barrier to performance of DPSO.

• Journal of applied mathematics & informatics
• /
• v.6 no.1
• /
• pp.1-14
• /
• 1999

In this paper we shall analyze the fully discrete Galerkin type approximations to solutions of the Rosenau equation. We provide the numerical results of several cases.

• Journal of the Chungcheong Mathematical Society
• /
• v.24 no.3
• /
• pp.561-568
• /
• 2011

We investigate the stability property and existence of almost periodic solutions of discrete Volterra equations with unbounded delay.

• The Journal of the Acoustical Society of Korea
• /
• v.23 no.1E
• /
• pp.3-9
• /
• 2004

An important inverse problem in the field of acoustics is that of reconstructing the strengths of a number of sources given a model of transmission paths from the sources to a number of sensors at which measurements are made. In dealing with this kind of the acoustical inverse problem, strengths of the discretised source distribution can be simply deduced from the measured pressure field data and the inversion of corresponding matrix of frequency response functions. However, deducing :he solution of such problems is not straightforward due to the practical difficulty caused by their inherent ill-conditioned behaviour. Therefore, in order to overcome this difficulty associated with the ill-conditioning, the problem is replaced by a nearby well-conditioned problem whose solution approximates the required solution. In this paper a microphone array are identified for which the inverse problem is optimally conditioned, which can be robust to contaminating errors. This involves sampling both source and field in a manner which results in the discrete pressures and source strengths constituting a discrete Fourier transform pair.

• Journal of the Korean Mathematical Society
• /
• v.48 no.4
• /
• pp.727-747
• /
• 2011

By employing coincidence degree theory and using Halanay-type inequality technique, a sufficient condition is given to guarantee the existence and global exponential stability of periodic solutions for the two-dimensional discrete-time Cohen-Grossberg BAM neural networks. Compared with the results in existing papers, in our result on the existence of periodic solution, the boundedness conditions on the activation are replaced with global Lipschitz conditions. In our result on the existence and global exponential stability of periodic solution, the assumptions in existing papers that the value of activation functions at zero is zero are removed.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.461-466
• /
• 1989

This paper describes some properties of a discrete algebraic Riccati equation and its application to $H^{\infty}$ control design. The conditions, under which an input weighting matrix can be found for a negative output weighting matrix in order that a solution P for a discrete algebraic equation may exist, are suggested in case of a stable A. This result is applied to a $H^{\infty}$ controller design for the special case of nonsingular B. It is based on a state feedback control law whose objective is to reduce the effect of input disterbances below a prespecified level. This law requires the solution of a modified algebraic Riccati equation, which provides an method for the $H^{\infty}$ optimization control problem approximately.ly.

• Bulletin of the Korean Mathematical Society
• /
• v.57 no.1
• /
• pp.219-244
• /
• 2020

In this paper, we approximate the solution of the coupled nonlinear Schrödinger equations by using a fully discrete finite element scheme based on the standard Galerkin method in space and implicit midpoint discretization in time. The proposed scheme guarantees the conservation of the total mass and the energy. First, a priori error estimates for the fully discrete Galerkin method is derived. Second, the existence of the approximated solution is proved by virtue of the Brouwer fixed point theorem. Moreover, the uniqueness of the solution is shown. Finally, convergence orders of the fully discrete Crank-Nicolson scheme are discussed. The end of the paper is devoted to some numerical experiments.