• International Journal of Reliability and Applications
• /
• v.10 no.2
• /
• pp.81-88
• /
• 2009

A non-parametric procedure is presented for testing exponentially against used better than aged in convex ordering class (UBAC) of life distributions based on u-test. Convergence of the proposed statistic to the normal distribution is proved. Selected critical values are tabulated for sample sizes 5(5)40. The Pitman asymptotic relative efficiency of my proposed test to tests of other classes is studied. An example of 40 patients suffering from blood cancer disease demonstrates practical application of the proposed test.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.1
• /
• pp.169-187
• /
• 1994

The efficiency of marketing channel of distribution between a sholesaler and a retailer with uncertain characteristics can be improved by influencing the retailer's ordering pattern. The wholesaler with large unit invetory holding cost can offer a large quantity discount tanks to the great benefit which comes from the transfer of part of his inventory to retailer. The retailer's increasing average inventory holding cost can be offset by the quantity discount and by savings of the ordering cost. Conditions under which marketing channel improvement can be possible are derived.

• Proceedings of the Korean Statistical Society Conference
• /
• 2005.05a
• /
• pp.53-57
• /
• 2005

In this paper, we develp the group ordering referecne priors for the differecne of the intraclass correlation coefficient in familial data. Using marginal posterior distributions under those priors, we compare frequentist coverage probabilities.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.11 no.17
• /
• pp.9-14
• /
• 1988

A (s, S) inventory policy is studied for a continuous inventory model in which lead times are dependent on the ordering quantity. The model assumes that at most one order is outstanding and demands occur in a compound poison process. The steady-state probability distributions of the inventory levels are derived so as to determine the long-run expected average cost. And the computational procedure is presented.

• Proceedings of the Safety Management and Science Conference
• /
• 2004.11a
• /
• pp.447-451
• /
• 2004

Generally, Fixed Quantity ordering system (Q-system) uses linear model in inventory decrease. This paper focuses on that Fixed Quantity ordering system (Q-system) is based on a continuous review system. To use a continuous review system is because of an inventory decrease ration is not constant. Therefore, this paper introduces a method to select a model which is proper to virtual data under conditions which are inconstant.

• KIISE Transactions on Computing Practices
• /
• v.24 no.1
• /
• pp.40-45
• /
• 2018

With the advent of big data and social networks, large-scale graph processing becomes popular research topic. Recently, an optimization technique called Gorder has been proposed to improve the performance of in-memory graph processing. This technique improves performance by optimizing the graph layout on memory to have better cache locality. However, since it is designed for in-memory graph processing systems, the technique is not suitable for disk-based graph engines; also the cost for applying the technique is significantly high. To solve the problem, we propose a new graph ordering called I/O Order. I/O Order considers the characteristics of I/O accesses for SSDs and HDDs to improve the performance of disk-based graph engine. In addition, the algorithmic complexity of I/O Order is simple compared to Gorder, hence it is cheaper to apply I/O Ordering. I/O order reduces the cost of pre-processing up to 9.6 times compared to that of Gorder's, still its performance is 2 times higher compared to the Random in low-locality graph algorithms.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.2
• /
• pp.82-90
• /
• 2002

BDD have become widely used for various CAD applications because Boolean functions can be represented uniquely and compactly by using BDD. The size of the BDD representation for a function is very sensitive to the choice of orderings on the input variable. Therefore, it is very important to find a good variable ordering which minimize the size of the BDD. Since finding an optimal ordering is NP-complete, several heuristic algorithms have been proposed to find good variable orderings. In this paper, we propose a variable ordering algorithm, Faster-${\mu}$0, based on the ${\mu}$0(microcanonical optimization). In the Faster-${\mu}$0 algorithm, the initialization phase is replaced with a shifting phase to produce better solutions in a fast local search. We find values for algorithm parameters experimentally and the proposed algorithm has been experimented on well known benchmark circuits and shows superior performance compared to various existing algorithms.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.6
• /
• pp.635-641
• /
• 2010

Time-varying channel characteristics in OFDM systems over doubly selective channels cause inter-carrier interferences(ICI) in the frequency domain. Time domain windowing gives rise to restriction on the bandwidth of the frequency domain channel matrix and makes it possible to approximate the OFDM system as a simplified linear input-output model. When successive interference cancellation based on linear MMSE estimation is employed for channel equalization in OFDM systems, symbol detection ordering produces considerable effects on overall system performances. In this paper, we show the reduction of the residual ICI by time domain windowing and the resultant performance improvements, and investigate the effects of SINR- and CSEP-based symbol detection ordering on the performance of successive interference cancellation.

• Journal of the Korean Vacuum Society
• /
• v.7 no.3
• /
• pp.187-194
• /
• 1998

InGaAsP epitaxial layers lattice matched to InP were grown at 600 and $620^{\circ}C$ by low pressure metalorganic chemical vapor deposition. Solid phase composition of group III was controlled by the diffusion flux gas phase to the reachion surface. For the case of group V, the difference of As and P vapor pressure and pyrolysis efficiency of $PH_3$and $AsH_3$ mainly determined their in corporation into solid. An abnormal behavior of peak energy shift was observed below 75K in temperature variant photoluminescence study. This abnormal behavior was explained by the difference in order of ordering which makes spatial variation of energy gap in InGaAsP layer and this explanation was supported by the analyses of transmission electron microscopy and transmission spectroscopy.

• Korean Management Science Review
• /
• v.13 no.2
• /
• pp.25-48
• /
• 1996

Mixed Model Assembly Lines (MMALs) are increasingly used to produce differentiated products on a single assembly line without work-in-process storage, Usually, a typical MMAL consists of a number of (1) stations doing exactly the same operation on every job, (2) stations involving operations with different choices, and (3) stations offering operations that are not performed on every job, or that are performed on every job but with many options. For stations of the first type there is no sequencing problem at all. However, for the second type a set-up cost is incurred each time the operation switches from one choice to another. At the third type of stations, different models, requring different amounts and choices of assembly work, creates an uneven flow of work along the line and variations in the work load at these stations. When a subsequence of jobs requires more work load than the station can handle, it is necessary to help the operations at the station or to complete the work elsewhere. Therefore, a schedule which minimize the sum of set-up cost and utility work cost is desired. So this study has developed Fixed Random Ordering Rule (FROR), Fixed Ascending Ordering Rule (FAOR), Fixed Descending Ordering Rule, and Extended NHR (ENHR). ENHR is to choose optimal color ordering of each batch with NHR, and to decide job sequence of the batch with it, too. As the result of experiments, ENHR was the best heuristic algorithm. NHR is a new heuristic rule in which only the minimum addition of violations from both partial sequence and unassigned sequence at every branch could be considered. And this is a heuristic sequencing rule for the third type of stations at MMAL. This study developed one more heuristic algorithm to test the performance of NHR, which is named as Practical Heuristic Rule (PHR).