• Journal of the Korean Operations Research and Management Science Society
• /
• v.4 no.1
• /
• pp.25-31
• /
• 1979

We consider the optimal ordering policy for a single-product two-stage inventory system where the main assumptions are as follows: (i) constant continuous demand only at stage 2, (ii) constant input (production) rate at stage 1, (iii) instantaneous delivery (transportation) from stage 1 to stage 2, (iv) backlogging is allowed only at stage 2, (v) an infinite planning horizon. Costs considered are ordering and linear holding costs at both stages, and linear shortage cost only at stages 2. By solving 9 different case problems, we have observed the general from of the optimal ordering policies for our model which minimizes the total cost per unit time. It is noticeable from this observation that the questionable but more often than not adopted assumption by many authors in determining the optimal potimal policy for multistage inventory systems, that the ordering (lot) sizes at each stage remain constant thruout the planning horizon, is not valid.

• 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.30 no.3
• /
• pp.190-196
• /
• 2004

In this paper, we address a layout design problem, PTL[3], for determining an optimal 3-class-based dedicated linear storage layout in a class of unit load storage systems. Our objective is to minimize the expected single command travel time. We analyze PTL[3] to derive a fundamental property that an optimal solution to PTL[3] is one of the partitions based on the PAI(product activity index)-nonincreasing ordering. Using the property and partial enumeration, we construct an efficient exact algorithm with O $(n\;{\lceil}\;log\;n\;{\rceil}\;)$ for solving PTL[3].

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.4
• /
• pp.591-600
• /
• 1998

The scheduling of parallel computing systems consists of two procedures, the assignment of tasks to each available processor and the ordering of tasks in each processor. The assignment procedure is same with a clustering. The clustering is classified into linear or nonlinear according to the precedence relationship of the tasks in each cluster. The parallel computing system can be modeled with a Directed Acyclic Graph(DAG). By the granularity theory, DAG is categorized into Coarse Grain Type(CDAG) and Fine Grain Type(FDAG). We suggest the linear clustering method for the scheduling of CDAG using the genetic algorithm. The method utilizes a properly that the optimal schedule of a CDAG is one of linear clustering. We present the computational comparisons between the suggested method for CDAG and an existing method for the general DAG including CDAG and FDAG.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.3
• /
• pp.471-478
• /
• 2007

The SA fillers encompass a large class of filters based on order statistics as veil as linear FIR filters. Using SA later structure, it is possible to design linear and non-linear filters under a unified framework. In this paper SA filters are applied to an image smoothing problem for mixed noise. Original image is contaminated by Gaussian and impulsive noise. Optimal SA filters are designed and applied to contaminated image. The experimental result shows that SA filters outperform linear FIR and ordering-based nonlinear filters.

• Journal of KIISE:Software and Applications
• /
• v.34 no.6
• /
• pp.572-583
• /
• 2007

This paper investigates Centering-based metrics to evaluate ordering of utterances for text structuring. We point out a problem of MIN.NOCB metric which has been regarded as the simplest and best measure to evaluate coherence of ordering within Centering framework, and propose a new Centering-based metric, MAX.CPS as an alternative or supplementary one. This paper introduces a framework which pre-estimates the effectiveness of a metric on a given input ordering, and selects an applicable metric according to the pre-estimation result. Using this framework, we propose a new policy which can generate more optimal ordering within Centering framework. Moreover, we evaluate several kinds of Cf-ranking methods in terms of Centering-based metrics, and find that simply ranking entities by their linear order is generally the most suitable because of characteristics in Korean.

• The Korean Journal of Applied Statistics
• /
• v.30 no.6
• /
• pp.889-899
• /
• 2017

Independent component analysis is a multivariate approach to separate mixed signals into original signals. It is the most widely used method of blind source separation technique. ICA uses linear transformations such as principal component analysis and factor analysis, but differs in that ICA requires statistical independence and non-Gaussian assumptions of original signals. PCA have a natural ordering based on cumulative proportion of explained variance; howerver, ICA algorithms cannot identify the unique optimal ordering of the components. It is meaningful to set order because major components can be used for further analysis such as clustering and low-dimensional graphs. In this paper, we compare the performance of several criteria to determine the order of the components. Kurtosis, absolute value of kurtosis, negentropy, Kolmogorov-Smirnov statistic and sum of squared coefficients are considered. The criteria are evaluated by their ability to classify known groups. Two types of data are analyzed for illustration.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.105-111
• /
• 2024

This paper deals with the minimum linear arrangement(MinLA) of a lattice graph, to which an approximate algorithm of linear complexity O(n) remains as a viable solution, deriving the optimal MinLA of 31,680 for 33×33 lattice. This paper proposes a partitioning arrangement algorithm of complexity O(1) that delivers exact solution to the minimum linear arrangement. The proposed partitioning arrangement algorithm could be seen as loading boxes into a container. It firstly partitions m rows into r₁,r₂,r₃ and n columns into c₁,c₂,c₃, only to obtain 7 containers. Containers are partitioning with a rule. It finally assigns numbers to vertices in each of the partitioned boxes location-wise so as to obtain the MinLA. Given m,n≥11, the size of boxes C₂,C₄,C₆ is increased by 2 until an increase in the MinLA is detected. This process repeats itself 4 times at maximum given m,n≤100. When tested to lattice in the range of 2≤n≤100, the proposed algorithm has proved its universal applicability to lattices of both m=n and m≠n. It has also obtained optimal results for 33×33 and 100×100 lattices superior to those obtained by existing algorithms. The minimum linear arrangement algorithm proposed in this paper, with its simplicity and outstanding performance, could therefore be also applied to the field of Very Large Scale Integration circuit where m,n are infinitely large.

• International Journal of Advanced Culture Technology
• /
• v.9 no.2
• /
• pp.91-99
• /
• 2021

In Korea, some pharmaceutical companies and agricultural machine manufacturers associate the length of the credit period with the retailer's order size. This kind of commercial practice is based on the principle of economy of scale from the supplier's point of view and tends to make retailer's order size large enough to qualify a certain credit period break. Also, the credit period allowed by the supplier makes it possible to reduce the retail price expecting that the retailer can earn more profits by the stimulating the customer's demand. Since the retailer's order size is affected by the end customer's demand, it is reasonable to determine the retail price and the order size simultaneously. In this regard, this paper analyzes the retailer's problem who has to decide his sales price and order quantity from a supplier who offers different credit periods depending on his order size. And we show that the retailer's order size large enough to qualify a certain credit period break. Also, it is assumed that the end customer's demand rate is represented by a linear decreasing function of the retail price.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.99-104
• /
• 2024

In the deficiency of an exact solution yielding algorithm, approximate algorithms remain as a solely viable option to the Minimum Linear Arrangement(MinLA) problem of Binary tree. Despite repeated attempts by a number of algorithm on k = 10, only two of them have been successful in yielding the optimal solution of 3,696. This paper therefore proposes an algorithm of O(n) complexity that delivers the exact solution to the binary tree. The proposed algorithm firstly employs an In-order search method by which n = 2^k - 1 number of nodes are assigned with a distinct number. Then it reassigns the number of all nodes that occur on level 2 ≤ 𝑙 ≤ k-2, (k = 5) and 2 ≤ 𝑙 ≤ k-3, (k = 6), including that of child of leaf node. When applied to k=5,6,7, the proposed algorithm has proven Chung[14]'s S^(k)_min=2^k-1+4+S^(k-1)_min+2S^(k-2)_min conjecture and obtained a superior result. Moreover, on the contrary to existing algorithms, the proposed algorithm illustrates a detailed assignment method. Capable of expeditiously obtaining the optimal solution for the binary tree of k > 10, the proposed algorithm could replace the existing approximate algorithms.