• Journal of the Korean Data and Information Science Society
• /
• v.15 no.1
• /
• pp.201-210
• /
• 2004

The peakedness ordering is closely related to dispersive ordering. In this paper we consider the statistical inference concerning peakedness ordering between two arbitrary symmetric distributions. Nonparametric maximum likelihood estimates of two distribution functions under symmetry and peakedness ordering are given. The likelihood ratio test for equality of two symmetric discrete distributions in the sense of peakedness ordering is studied.

• Journal of applied mathematics & informatics
• /
• v.5 no.1
• /
• pp.41-50
• /
• 1998

There are various notions of partial ordering between life-times of systems; stochastic ordering failure rate ordering and likeli-hood ration ordering. In this paper we show that for series systems with non i.i.d. exponential lifetimes of components standby redundancy at component level is better than that at system level in failure rate or-dering and likelihood ratio ordering. We also demonstrate that for 2-component parallel systems with i.i.d. exponential lifetimes of com-ponents standby system redundancy is better than standby component redundancy in failure rate ordering and likelihood ratio ordering.

• Industrial Engineering and Management Systems
• /
• v.11 no.2
• /
• pp.134-141
• /
• 2012

It is difficult to find an appropriate ordering policy for a many types of items. One of the reasons for this difficulty is that each item has a different demand trend. We will classify items by shipment trend and then decide the ordering policy for each item category. In this study, we indicate that categorizing items from their statistical characteristics leads to an ordering policy suitable for that category. We analyze the ordering policy and shipment trend and propose a new method for selecting the ordering policy which is based on finding the strongest relation between the classification of the items and the ordering policy. In our numerical experiment, from actual shipment data of about 5,000 items over the past year, we calculated many statistics that represent the trend of each item. Next, we applied the canonical correlation analysis between the evaluations of ordering policies and the various statistics. Furthermore, we applied the cluster analysis on the statistics concerning the performance of ordering policies. Finally, we separate items into several categories and show that the appropriate ordering policies are different for each category.

• Proceedings of the Korean Statistical Society Conference
• /
• 2003.05a
• /
• pp.109-114
• /
• 2003

The concept of dispersion is intrinsic to the theory and practice of statistics. A formulation of the concept of dispersion can be obtained by comparing the probability of intervals centered about a location parameter, which is peakedness ordering introduced first by Birnbaum (1948). We consider statistical inference concerning peakedness ordering between two arbitrary distributions. We propose nonparametric maximum likelihood estimator of two distributions under peakedness ordering and a likelihood ratio test for equality of dispersion in the sense of peakedness ordering.

• Journal of the Korean Statistical Society
• /
• v.33 no.3
• /
• pp.303-312
• /
• 2004

The concept of dispersion is intrinsic to the theory and practice of statistics. A formulation of the concept of dispersion can be obtained by comparing the probability of intervals centered about a location parameter. This is the peakedness ordering introduced first by Birnbaum (1948). We consider statistical inference concerning peakedness ordering between two arbitrary distributions. We propose non parametric maximum likelihood estimators of two distributions under peakedness ordering and a likelihood ratio test for equality of dispersion in the sense of peakedness ordering.

• Management Science and Financial Engineering
• /
• v.8 no.1
• /
• pp.1-19
• /
• 2002

Ordering is used to reduce the amount of fill-ins in the Cholesky factor of a symmetric positive definite matrix. One of the most efficient ordering methods is the minimum degree ordering algorithm(MDO). In this paper, we provide a few techniques that improve the performance of MDO implemented with the clique storage scheme. First, the absorption of nodes in the cliques is developed which reduces the number of cliques and the amount of storage space required for MDO. Second, we present a modified minimum degree ordering algorithm of which the number of degree updates can be reduced by introducing the lower bounds of degrees. Third, using both the lower and upper bounds of degrees, we develop an approximate minimum degree ordering algorithm. Experimental results show that the proposed algorithm is competitive with the minimum degree ordering algorithm that uses quotient graphs from the points of the ordering time and the nonzeros in the Cholesky factor.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.567-571
• /
• 2008

In this paper, an overview on the ordering sphere decoder (SD) class for space-time codes (STC) will be presented. In SDs, the ordering techniques are considered as promising methods for reducing complexity by exploiting a sorted list of candidates, thus decreasing the number of tested points. First, we will present the current state of art of SD with their advantages and disadvantages. Then, the overview of simply geometrical approaches for ordering is presented to address the question to overcome the disadvantages. The computer simulation results shown that, thanks to the aid of ordering, the ordering SDs can achieve optimal bit-error-rate (BER) performance while requiring the very low complexity, which is comparable to that of linear sub-optimal decoders.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.1
• /
• pp.1-12
• /
• 2008

The Kanban system in Just-In-Time (JIT) production is very effective in reducing the inventories when consumption rate of the final product is relatively stable. When large fluctuations exist in the consumption rate, a new production ordering policy in which the production order quantity is determined by smoothing the demands exponentially is more suitable. This new ordering policy has not been investigated sufficiently. In this research, a multi-stage production and inventory system with stock points for materials and finished items located at each stage is considered. Approximations of average inventories at each stage in the system are derived theoretically. Numerical simulations are carried out to assess the accuracy of approximations and to evaluate the effectiveness of the new ordering policy as compared with the Kanban system. As a result, it is shown that the new ordering policy can achieve significantly lower inventory costs than the original Kanban system. The new ordering policy thus emerges as a key concept for an effective supply chain management.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.3
• /
• pp.63-74
• /
• 1996

Ordering plays an important role in solving an LP problem with sparse matrix by the interior point method. Since ordering is NP-complete, we try to find an efficient method. The objective of this paper is to present an efficient heuristic ordering method for implementation of the minimum deficiency method. Both the ordering method and the data structure play important roles in implementation. First we define a new heuristic pseudo-deficiency ordering method and a data structure for the method-quotient graph and cliqued storage. Next we show an experimental result in terms of time and nonzero numbers by NETLIB problems.

• Journal of Korean Society for Quality Management
• /
• v.35 no.1
• /
• pp.20-23
• /
• 2007

A generalized spare ordering policy is treated in this paper. If the operating unit fails before a scheduled ordering time an expedited order is placed at the failure time instant, otherwise a regular order for a spare is placed at the scheduled time. The original unit is replaced when the ordered spare is delivered. The lifetime, regular and expedited lead times have general distributions. The problem is to find the optimum ordering time which minimizes the expected cost rate including the observation, ordering, uptime and down-time costs. Some properties regarding the optimal policy are derived. To explain the spare ordering policy a numerical example is also included.