• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.4
• /
• pp.27-44
• /
• 2000

In this study we consider a spares provisioning problem for repairable items in which a parts inventory system is incorporated. If a machine fails, a replacement part must be obtained at the parts inventory system before the failed machine enters the repair center. The inventory policy adopted at the parts inventory system is the (S, Q) policy. Operating times of the machine before failure, ordering lead times and repair times are assumed to follow a two-stage Coxian distribution. For this system, we develop an approximation method to obtain the performance measures such as steady state probabilities of the number of machines at each station and the probability that a part will wait at the parts inventory system. For the analysis of the proposed system, we model the system as a closed queueing network and analyze it using a product-form approximation method. A recursive technique as well as an iterative procedure is used to analyze the sub-network. Numerical tests show that the approximation method provides fairly good estimation of the performance measures of interest.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3C
• /
• pp.296-306
• /
• 2003

In this paper, algorithm for non-iterative decoding method is proposed and fractal image decoder based on non-iterative fractal decoding algorithm used general purpose digital signal processors is designed and implemented. The algorithm is showed that the attractor image can be obtained analytically whe n the image is encoded using the fractal algorithm proposed by Monro and Dudbridge, in which the corresponding domain block for a range block is fifed. Using the analytical formulas, we can obtain the attractor image without iteration procedure. And we get general formulas of obtained analytical formulas. Computer simulation results for various test images show that we can increase the image decoding speed by more than five times when we use the analytical formulas compared to the previous iteration methods. The fractal image decoder contains two ADSP2181's and perform image decoding by three stage pipeline structure. The performance tests of the implemented decoder is elapsed 31.2ms/frame decoding speed for QCIF data when all the frames are decoded. The results enable us to process the real-time fractal decoding over 30 frames/sec.

• Korean Journal of Clinical Pharmacy
• /
• v.23 no.2
• /
• pp.137-141
• /
• 2013

Purpose: This study compared the performance of new NONMEM estimation methods using a population analysis dataset collected from a clinical study that consisted of 40 individuals and 567 observations after a single oral dose of glimepiride. Method: The NONMEM 7.2 estimation methods tested were first-order conditional estimation with interaction (FOCEI), importance sampling (IMP), importance sampling assisted by mode a posteriori (IMPMAP), iterative two stage (ITS), stochastic approximation expectation-maximization (SAEM), and Markov chain Monte Carlo Bayesian (BAYES) using a two-compartment open model. Results: The parameters estimated by IMP, IMPMAP, ITS, SAEM, and BAYES were similar to those estimated using FOCEI, and the objective function value (OFV) for diagnosing the model criteria was significantly decreased in FOCEI, IMPMAP, SAEM, and BAYES in comparison with IMP. Parameter precision in terms of the estimated standard error was estimated precisely with FOCEI, IMP, IMPMAP, and BAYES. The run time for the model analysis was shortest with BAYES. Conclusion: In conclusion, the new estimation methods in NONMEM 7.2 performed similarly in terms of parameter estimation, but the results in terms of parameter precision and model run times using BAYES were most suitable for analyzing this dataset.

• Journal of Korean Institute of Industrial Engineers
• /
• v.14 no.1
• /
• pp.119-131
• /
• 1988

Vehicle Scheduling Problem (VSP) is a generic name given to a whole class of problems involving the visiting of "stations" by "vehicles," where a time is associated with each activity. The studies performed to date have the common feature of a single objective while satisfying a set of restrictions and known customer supplies or demands. However, VSPs may involve relevant multiple objectives and probabilistic supplies or demands at stations, creating multicriteria stochastic VSPs. This paper proposes a heuristic algorithm based on goal programming approach to schedule the most satisfactory vehicle routes of a bicriteria VSP with probabilistic supplies at stations. The two relevant objectives are the minimization of the expected travel distance of vehicles and the minimization of the due time violation for collection service at stations by vehicles. The algorithm developed consists of three major stages. In the first stage, an artificial capacity of vehicle is determined, on the basis of decision maker's subjective estimates. The second one clusters a set of stations into subsets by applying an efficient cluster method developed. In the third one, the stations in each subset are scheduled by applying an iterative goal programming heuristic procedure to each cluster.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.2
• /
• pp.53-64
• /
• 2002

This paper describes a design of cryptographic processor that implements the AES (Advanced Encryption Standard) block cipher algorithm, "Rijndael". An iterative looping architecture using a single round block is adopted to minimize the hardware required. To achieve high throughput rate, a sub-pipeline stage is added by dividing the round function into two blocks, resulting that the second half of current round function and the first half of next round function are being simultaneously operated. The round block is implemented using 32-bit data path, so each sub-pipeline stage is executed for four clock cycles. The S-box, which is the dominant element of the round block in terms of required hardware resources, is designed using arithmetic circuit computing multiplicative inverse in GF($2^8$) rather than look-up table method, so that encryption and decryption can share the S-boxes. The round keys are generated by on-the-fly key scheduler. The crypto-processor designed in Verilog-HDL and synthesized using 0.25-$\mu\textrm{m}$ CMOS cell library consists of about 23,000 gates. Simulation results show that the critical path delay is about 8-ns and it can operate up to 120-MHz clock Sequency at 2.5-V supply. The designed core was verified using Xilinx FPGA board and test system.

• Tribology and Lubricants
• /
• v.36 no.2
• /
• pp.96-104
• /
• 2020

The electric vehicle industry is rapidly developing because of enforced environmental regulations, and several studies have been conducted on the multispeed transmission to improve the fuel efficiency of electric vehicles. Among these studies, research on the power density improvement of electric vehicle transmission is critical. Thus, the optimal design of the gear train is necessary to enhance transmission efficiency. In this study, an optimal design methodology for the lightweight two-speed transmission of electric vehicles is proposed. Because a multispeed transmission has many operating conditions and equality and inequality constraints, a new gear design method that combines analytical and iterative methods is applied without using complex optimization algorithms. Sets of possible design variables are generated considering the operating conditions and various design variables. The modules and face width ratios of each stage gear that satisfy the corresponding operating conditions are analytically calculated. The volume of the gear train is calculated, evaluated, and arranged using these values to determine the optimal solution for minimizing the volume, and the proposed methodology is applied to the actual model to verify its effectiveness. The design of a two-speed transmission with multiple operating conditions and constraints without complicated optimization algorithms can be optimized.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2722-2742
• /
• 2014

We propose methods of linear transceiver design for two different power constraints, sum relay power constraint and per relay power constraint, which determine signal processing matrices such as base station (BS) transmitter, relay precoders and user receivers to minimize sum mean square error (SMSE) for multi-relay multi-user (MRMU) networks. However, since the formulated problem is non-convex one which is hard to be solved, we suboptimally solve the problems by defining convex subproblems with some fixed variables. We adopt iterative sequential designs of which each iteration stage corresponds to each subproblem. Karush-Kuhn-Tucker (KKT) theorem and SMSE duality are employed as specific methods to solve subproblems. The numerical results verify that the proposed methods provide comparable performance to that of a full relay cooperation bound (FRCB) method while outperforming the simple amplify-and-forward (SAF) and minimum mean square error (MMSE) relaying in terms of not only SMSE, but also the sum rate.

• Wind and Structures
• /
• v.16 no.2
• /
• pp.157-178
• /
• 2013

Output-only modal parameter identification is based on the assumption that external forces on a linear structure are white noise. However, harmonic excitations are also often present in real structural vibrations. In particular, it has been realized that the use of forced acceleration responses without knowledge of external forces can pose a problem in the modal parameter identification, because an external force is imparted to its impulse acceleration response function. This paper provides a three-stage identification procedure as a solution to the problem of harmonic and white noise excitations in the acceleration responses of a linear dynamic system. This procedure combines the uses of the mode indicator function, the complex mode indication function, the enhanced frequency response function, an iterative rational fraction polynomial method and mode shape inspection for the correlation-related functions of the force-embedded acceleration responses. The procedure is verified via numerical simulation of a five-floor shear building and a two-dimensional frame and also applied to ambient vibration data of a large-span roof structure. Results show that the modal parameters of these dynamic systems can be satisfactorily identified under the requirement of wide separation between vibration modes and harmonic excitations.

• Korean Journal of Remote Sensing
• /
• v.37 no.3
• /
• pp.475-491
• /
• 2021

With the recent increase in available high-resolution (< ~1 m) satellite SAR images, the demand for precise registration of SAR images is increasing in various fields including change detection. The registration between high-resolution SAR images acquired in different look angle is difficult due to speckle noise and geometric distortion caused by the characteristics of SAR images. In this study, registration is performed in two stages, coarse and fine, using the x-band SAR data imaged at staring spotlight mode of TerraSAR-X. For the coarse registration, a method combining the adaptive sampling method and SAR-SIFT (Scale Invariant Feature Transform) is applied, and three rigid methods (NCC: Normalized Cross Correlation, Phase Congruency-NCC, MI: Mutual Information) and one non-rigid (Gefolki: Geoscience extended Flow Optical Flow Lucas-Kanade Iterative), for the fine registration stage, was performed for performance comparison. The results were compared by using RMSE (Root Mean Square Error) and FSIM (Feature Similarity) index, and all rigid models showed poor results in all image combinations. It is confirmed that the rigid models have a large registration error in the rugged terrain area. As a result of applying the Gefolki algorithm, it was confirmed that the RMSE of Gefolki showed the best result as a 1~3 pixels, and the FSIM index also obtained a higher value than 0.02~0.03 compared to other rigid methods. It was confirmed that the mis-registration due to terrain effect could be sufficiently reduced by the Gefolki algorithm.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.5
• /
• pp.873-882
• /
• 1992

The study is concerned with the rigid-plastic element analysis for axisymmetric hydromechanical deep drawing in which the fluid flow influences the metal deformation. Due to the fluid pressure acting on the sheet material hydromechanical deep drawing is distinguished from the conventional deep drawing processes. In considering the pressure effect, the governing equation for fluid pressure is solved and the result is reflected on the global stiffness matrix. The solution procedure consists of two stages ; i.e., initial bulging of the sheet surface before the initiation of steady fluid flow in the flange and fluid-lubricated stage. The problem is decoupled between fluid analysis and analysis of solid deformation by deformation by iterative feedback of mutual computed results. The corresponding experiments are carried out for axisymmetric hydro-mechanical deep drawing of annealled aluminium sheet as well as for deep drawing. It has been shown from the experiments that the limit drawing ratio for hydro-mechanical deep drawing is improved as compared with deep drawing. The computed results are in good agreement with the experiment for variation of punch head and chamber pressure with respect to the punch travel and for distribution of thicknees strain. It is thus shown that the present method of analysis can be effectively applied to the analysis of axisymmetric hydro-mechanical deep drawing processes.