• Bulletin of the Korean Chemical Society
• /
• v.20 no.9
• /
• pp.1061-1066
• /
• 1999

The adsorption of CO on W(111) surface in the range of adsorption temperature between 300 K and 1000 K has been studied using AES, LEED, and TDS in an UHV system. After CO saturation at 300 K, four desorption peaks are observed at temperatures (K) of about 400, 850, 1000, and 1100 in thermal desorption spectra, called as α, β1, β2, and β3 state, respectively. The state was attributed to molecular species of CO, which is well known. Because the CO in βstates (especially the β3 state) is still debated as to whether it is dissociative or non-dissociative, the β3 state is mainly discussed. By using the variation method of heating rate in the thermal desorption spectrometry, the desorption energy and pre-exponential factor for the β3 state are evaluated to be 280 kJ/mol and 1.5×10 12 s-1 , respectively. A lateral interaction energy of 5.7 kJ/mol can also be estimated by Bragg-Williams approximation. To interpret the thermal desorption spectra for the β3 state, moreover, those for the model of a first order and a second order desorption are simulated using quasi-chemical approximation. In this study, a model of lying-down CO species is proposed for the β3 state of CO adsorption.

• International Journal of Aeronautical and Space Sciences
• /
• v.11 no.1
• /
• pp.10-18
• /
• 2010

The purpose of this paper deals with direct multiple-shooting method (DMS) to resolve helicopter maneuver problems of helicopters. The maneuver problem is transformed into nonlinear problems and solved DMS technique. The DMS method is easy in handling constraints and it has large convergence radius compared to other strategies. When parameterized with piecewise constant controls, the problems become most effectively tractable because the search direction is easily estimated by solving the structured Karush-Kuhn-Tucker (KKT) system. However, generally the computation of function, gradients and Hessian matrices has considerably time-consuming for complex system such as helicopter. This study focused on the approximation of the KKT system using the matrix exponential and its integrals. The propose method is validated by solving optimal control problems for the linear system where the KKT system is exactly expressed with the matrix exponential and its integrals. The trajectory tracking problem of various maneuvers like bob up, sidestep near hovering flight speed and hurdle hop, slalom, transient turn, acceleration and deceleration are analyzed to investigate the effects of algorithmic details. The results show the matrix exponential approach to compute gradients and the Hessian matrix is most efficient among the implemented methods when combined with the mixed time integration method for the system dynamics. The analyses with the proposed method show good convergence and capability of tracking the prescribed trajectory. Therefore, it can be used to solve critical areas of helicopter flight dynamic problems.

• Journal of Korean Society for Quality Management
• /
• v.22 no.1
• /
• pp.152-161
• /
• 1994

In this paper we develop a test for alternatives representing decreasing mean residual life. The test statistic for decreasing mean residual life, $K_{1n}$, is a modified version of Hollander and Proschan's test $V^*$ and critical constants and large sample approximation are shown to make the test readily applicable. Consistency is also shown for the tests based on $K_{1n}$. And small sample powers for four alernatives are obtained.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.4
• /
• pp.51-69
• /
• 1997

Recently Lee et al[5] developed an approximation algorithm for the performance evaluation of the open queueing networks with blocking. This algorithm, which solves the exponential queueing networks with general configuration is developed based on the symmetrical decomposition approach and is reported to have many advantages over the previous algorithmsf. In addition to being very accurate, this algorithm is reported to be quite simple, pretty fast and solves very general configurations. In this study, we show that if a network has a tree-like configurations, the algorithm developed by Lee at al, always converges to the unique solution. To prove the theoretical results pertaining to the algorithm, some properties associated with symmetrical decomposition approach are exploited. The results obtained in this study such as the proofs of convergence of the algorithm as well as uniquences of the solution would contribute to the theoretical study for the non-tandem configurating of open queueing network.

• The KIPS Transactions:PartB
• /
• v.9B no.1
• /
• pp.17-22
• /
• 2002

A major impediment in using the Dempster-chafer evidence combination scheme is its computational complexity, which in general is exponential since DS scheme allows any subsets over the frame of discernment as focal elements. To avoid this problem, we propose a method called approximate evidence combination scheme. This scheme is applied to a few sample applications and the experiment results are compared with those of VBS. The results show that the approximation scheme achieves a great amount of computational speedup and produces belief values within the range of deviation that the expert allows.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.21 no.1
• /
• pp.73-78
• /
• 2008

A resistor network model for the horizontal AlInGaN LED was investigated, The parameters of the proposed model are extracted from the test dies and $350{\mu}m$ LED, The center of the P-area is the optimal position of a P-electrode by the simulation using the model. Also the optimal chip size of the LED for the new target current was investigated, Comparing the simulation and fabrication result, the errors for the forward voltage and the light power are average 0,02 V, 8 % respectively, So the proposed resistor network model with the linear forward voltage approximation and the exponential light power model are useful in the simulation for the horizontal AlInGaN LED.

• Journal of the military operations research society of Korea
• /
• v.17 no.1
• /
• pp.43-60
• /
• 1991

Consider N queues without arrivals and with m identical servers. All jobs are independent and service requirements of jobs in a queue are i.i.d. random variables. At any time only one server may be assigned to a queue and switching between queues are allowed. A unit cost is imposed per job per unit time. The objective is to minimized the expected total cost. An flow approximation model is considered and an upperbound for the percentage error of best nonswitching policies to an optimal policy is found. It is shown that the best nonswitching policy is not worse than $11\%$ of an optimal policy For the stochastic model, we consider the case in which the service requirements of all jobs are i.i.d. with an exponential distribution. A longest first policy is shown to be optimal and a worst case analysis shows that the nonswitching policy which starts with the longest queues is not worse than $11\%$ of the optimal policy.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.3
• /
• pp.803-814
• /
• 2016

Recent times have seen an exponential increase in the amount of spatial data, which is in many cases associated with temporal data. Recent advances in computer technology and computation of hierarchical Bayesian models have enabled to analyze complex spatio-temporal data. Our work aims at modeling data of daily average nitrogen dioxide (NO2) levels obtained from 25 air monitoring sites in Seoul between 2003 and 2010. We considered an independent Gaussian process model and an auto-regressive model and carried out estimation within a hierarchical Bayesian framework with Markov chain Monte Carlo techniques. A Gaussian predictive process approximation has shown the better prediction performance rather than a Hierarchical auto-regressive model for the illustrative NO2 concentration levels at any unmonitored location.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4950-4966
• /
• 2015

Cloud providers now face the problem of estimating the amount of computing resources required to satisfy a future workload. In this paper, a virtual machine provisioning (VMP) mechanism is designed to adapt workload fluctuation. The arrival rate of forthcoming jobs is predicted for acquiring the proper service rate by adopting an exponential smoothing (ES) method. The proper service rate is estimated to guarantee the service level agreement (SLA) constraints by using a diffusion approximation statistical model. The VMP problem is formulated as a facility location problem. Furthermore, it is characterized as the maximization of submodular function subject to the matroid constraints. A greedy-based VMP algorithm is designed to obtain the optimal virtual machine provision pattern. Simulation results illustrate that the proposed mechanism could increase the average profit efficiently without incurring significant quality of service (QoS) violations.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.03b
• /
• pp.487-490
• /
• 2008

A theoretical study is made of the flow in a confined cylindrical container with differential rotating top and bottom disks. Two kinds of theoretical solution for the azimuthal velocity were obtained: one is an exact solution of Bessel function type and the other is an approximate solution of exponential function type which comes from WKB approximation. Both theoretical solutions are shown to be self consistent with each other as well as a good agreement with previous studies. Moreover, in a range of relatively low Reynolds number, the obtained solution of Bessel function type shows better result than previous solutions.