• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.485-487
• /
• 1999

We propose the algorithm with which one can solve the problem of the two-level hierarchical optimal control of nonlinear systems by repeatedly updating the state vectors using the haar function and Picard's iteration methods. Using the simple operation of the coefficient vectors from the fast haar transformation in the upper level and applying that vectors to Picard iteration methods in the independently lower level allow us to obtain the another method except the inversion matrix operation of the high dimention and the kronecker product in the optimal control algorithm.

• Journal of Information Processing Systems
• /
• v.11 no.4
• /
• pp.616-629
• /
• 2015

A mobile terminal will expect a number of handoffs within its call duration. In the event of a mobile call, when a mobile node moves from one cell to another, it should connect to another access point within its range. In case there is a lack of support of its own network, it must changeover to another base station. In the event of moving on to another network, quality of service parameters need to be considered. In our study we have used the Markov decision process approach for a seamless handoff as it gives the optimum results for selecting a network when compared to other multiple attribute decision making processes. We have used the network cost function for selecting the network for handoff and the connection reward function, which is based on the values of the quality of service parameters. We have also examined the constant bit rate and transmission control protocol packet delivery ratio. We used the policy iteration algorithm for determining the optimal policy. Our enhanced handoff algorithm outperforms other previous multiple attribute decision making methods.

• Bulletin of the Korean Chemical Society
• /
• v.12 no.5
• /
• pp.574-582
• /
• 1991

The CO molecules adsorbed on Ni(111) surface is studied in the cluster approximation employing EH method with self-consistent charge iteration. The effect of CO coverage is simulated by allowing the variation of valence state ionization potentials of each Ni atom in model cluster according to the self-consistent charge iteration method. The CO coverage dependent C-O stretching frequency shift, adsorption site conversion, and metal work function change are attributed to the charge transfer between metal surface and adsorbate. For CO/Ni(111) system, net charge transfer from Ni surface to chemisorbed CO molecules makes surface Ni atoms be more positive with increasing coverage, and lowers Ni surface valence band. This leads to a weaker interaction between metal surface valence band and Co $2{\pi}^{\ast}$ MO, less charge transfer to a single CO molecule, and the bule shift of C-O stretching frequency. Further increase of coverage induces the conversion of 3-fold site CO to lower coordination site CO as well as the blue shift of C-O stretching frequency. This whole process is accompanied by the continuous increase of metal work function.

• Structural Engineering and Mechanics
• /
• v.7 no.3
• /
• pp.241-257
• /
• 1999

This paper presents a procedure to minimize the cost of materials of cable-stayed bridges with composite box girder and concrete tower. Two sets of iterations are included in the proposed procedure. The first set of iteration performs the structural analysis for a cable-stayed bridge. The second set of iteration performs the optimization process. The design is formulated as a general mathematical problem with the cost of the bridge as the objective function and bending forces, shear forces, fatigue stresses, buckling and deflection as constraints. The constraints are developed based on the Canadian National Standard CAN/CSA-S6-88. The finite element method is employed to perform the complicated nonlinear structural analysis of the cable-stayed bridges. The internal penalty function method is used in the optimization process. The limit states design method is used to determine the load capacity of the bridge. A computer program written in FORTRAN 77 is developed and its validity is verified by several practical-sized designs.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.4
• /
• pp.3-16
• /
• 2010

Key derivation functions are used within many cryptographic systems in order to generate various keys from a fixed short key string. In this paper we survey a state-of-the-art in the key derivation functions and wish to examine the soundness of the functions on the view point of provable security. Especially we focus on the key derivation functions using pseudorandom functions which are recommended by NISI recently, and show that the variant of Double-Pipeline Iteration mode using pseudorandom permutations is a pseudorandom function. Block ciphers can be regarded as practical primitives of pseudorandom permutations.

• Journal of the Chungcheong Mathematical Society
• /
• v.16 no.1
• /
• pp.113-121
• /
• 2003

This paper is concerned with some properties of stable domains and limit functions. Using the relationship between cycles of periodic stable domains and orbits of critical points and using the Sullivan theorem [19], we prove that the value of a constant limit function in some stable domain for a rational function f of degree at least two lies in the closure of the set of critical orbits of f.

• Journal of the Chungcheong Mathematical Society
• /
• v.15 no.2
• /
• pp.47-56
• /
• 2003

This note is concerned with some properties of fixed points and periodic points. First, we have constructed a generalized continuous function to give a proof for the fact that, as the reverse of the Sharkovsky theorem[16], for a given positive integer n, there exists a continuous function with a period-n point but no period-m points wherem is a predecessor of n in the Sharkovsky ordering. Also we show that the composition of two transcendental meromorphic functions, one of which has at least three poles, has infinitely many fixed points.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1998.05b
• /
• pp.336-343
• /
• 1998

An iteration method has been developed for determining crack growth and fracture resistance cure (J-R curve) from the load versus load-line displacement record only. In this method, the hardening curve, the load versus displacement curve at a given crack length, is assumed to be a power-law function, where the exponent varies with the crack length. The exponent is determined by an iterative calculation method with the assumption that the exponent varies linearly with the load-line displacement. The proposed method was applied to the static J-R tests using compact tension(CT) specimens, a three-point bend (TPB) specimen, and a cracked round bar (CRB) specimen as well as it was applied to the quasi-dynamic J-R tests using CT specimens. The J-R curves determined by the proposed method were compared with those obtained by the conventional testing methodologies. The results showed that the J-R curves could be determined directly by the proposed iteration method with sufficient accuracy in the specimens from SA508, SA533, and SA516 pressure vessel steels and SA312 Type 347 stainless steel.

• Korean Journal of Computational Design and Engineering
• /
• v.20 no.1
• /
• pp.36-43
• /
• 2015

Recently, a number of evaluation studies on availability of plant were carried out. This study was conducted to verify of the reliability of a simulation with some variable such as configuration of process, failure probability density function and the number of iteration times for the natural gas liquefaction plant. The error rate of the KICT-RAM solution was evaluated as 0.03~1.79% compared with the result of the MAROS(commercial solution). And the error-rate change was observed in the range of 0.03~1.75 on the condition of the iteration times as 30, 100, 250. As a result the plant availability evaluation approach of KICT-RAM solution was verified as reasonable. However, the careful approach was required to use the solution because the error-rate increased according to iteration times change.

• Korean Journal of Mathematics
• /
• v.26 no.1
• /
• pp.1-7
• /
• 2018

In this paper, we will study a generalized version of Josephus where a serial execution occurs at each iteration and give a non-recursive formula for the initial positions of survivors.