• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.130-133
• /
• 1998

A imput buffer typed ATM switch and an appropriate cell-scheduling algorithm are necessary for avoiding output blocking and internal blocking respectively. The algorithm determining a set of non-blocking data cells from the queues can greatly affect on the switch's throughput as well as the behavior of the queues. In this paper bit pattern optimization combined with the Token method in presented in order to improve the performance of ATM switch. The digital Hopfield neural cell scheduler is designed and used for the maximum numbers of cells in real-time

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.46.4-46
• /
• 2002

This study was motivated how it might be possible to validate structured sampling with orthogonal array for optimal design of a pin. The Taguchi method by orthogonal array, one of the structured sampling methods, has much advantage that is row cost and time saving for experiments. But this method has been applied in limited areas especially for mechanical problems. In this study, we experimented whether the structured sampling is useful for applying optimal design of mechanical elements. For the experiment, we first set up a mechanical problem which was related to determining optimal parameters associated a pin's crack occurred inside a hole. We, then, calculated combination of...

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.643-646
• /
• 1999

In this paper, we propose a feature extraction method based on Bhattacharyya distance for multiclass problems. The Bhattacharyya distance provides a valuable information in determining the effectiveness of a feature set and has been used as separability measure for feature selection. Recently, a feature extraction algorithm hat been proposed for two normally distributed classes based on Bhattacharyya distance. In this paper, we propose to expand the previous approach to multiclass cases. Experiment results show that the proposed method compares favorably with the conventional methods.

• Proceedings of the Safety Management and Science Conference
• /
• 2002.05a
• /
• pp.237-241
• /
• 2002

This paper deals with the problem of determining the buyer's economic lot sizing policy for exponentially deteriorating products under trade credit. It is also assumed that the ordering cost consists of a fixed set-up cost and a freight cost, where the freight cost has a quantity discount offered due to the economies of scale. We formulate the mathematical model and the solution algorithm is developed based on the properties of an optimal solution.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.4
• /
• pp.610-617
• /
• 1987

This thesis is concerned with fault-tolerance of a B-net (Beta-network) which is a kind of interconnection network in the multicomputer system. In this paper, a method for obtaining Maximal Tolerable Fault Set(MTFS) of link line connecting switching elements in the arbitrary B-net is presented. Using this method, it is seen that testing of DFA capability is possible when s-a-faults of link line occur, and criterion for determining degree of fault- tolerance of a B-net in terms of link line is introduced.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.983-994
• /
• 2000

We consider the problem of determining the circle of best fit to a set of data points in the plane. In [1] and [2] several algorithms already have been given for fitting a circle in least squares sense of minimizing the geometric distances to the given data points. In this paper we present another new descent algorithm which computes a parametric represented circle in order to minimize the sum of the squares of the distances to the given points. For any choice of starting values our algorithm has the advantage of ensuring convergence to a local minimum. Numerical examples are given.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.1-22
• /
• 2011

In this paper, a Lotka-Volterra model with time delays is considered. A set of sufficient conditions for the existence of Hopf bifurcation are obtained via analyzing the associated characteristic transcendental equation. Some explicit formulae for determining the stability and the direction of the Hopf bifurcation periodic solutions bifurcating from Hopf bifurcations are obtained by applying the normal form method and center manifold theory. Finally, the main results are illustrated by some numerical simulations.

• Journal of the Korean Statistical Society
• /
• v.5 no.1
• /
• pp.49-59
• /
• 1976

This paper is to present an iterative method for determining an optimum geographic location pattern for the warehouses (sources) that are employed to serve or supply, known quantities of its finished product to a set of custormer areas (destinations) that have fixed and known locations, where the number of sources is permitted to vary. What must be determined, in this paper, is the number and location of the sources or warehouses that will minimize the combined costs of transferring and storing the total quantity of products demanded in the destinations or customer areas.

• Management Science and Financial Engineering
• /
• v.19 no.1
• /
• pp.25-28
• /
• 2013

Consider the inverse bin-packing number problem. Given a set of items and a prescribed number K of bins, the inverse bin-packing number problem, IBPN for short, is concerned with determining the minimum perturbation to the item-size vector so that all the items can be packed into K bins or less. It is known that this problem is NP-hard (Chung, 2012). In this paper, we investigate some special cases of IBPN that can be solved in polynomial time. We propose an optimal algorithm for solving the IBPN instances with two distinct item sizes and the instances with large items.

• Industrial Engineering and Management Systems
• /
• v.7 no.1
• /
• pp.1-8
• /
• 2008

Having previously presented an article entitled "Further approximate optimum inspection intervals" in this Journal, here the author derives an alternative set of general explicit formulae using Cardan's solution to a cubic equation and presents a modified heuristic algorithm for solving Baker's model. The examples show that this new alternative approximate solution procedure for determining near optimum inspection intervals is as accurate and computationally efficient as the one suggested in the previous article. Through the examples, the author also indicates the relative merits and demerits of the two algorithms.