• Communications for Statistical Applications and Methods
• /
• v.18 no.2
• /
• pp.257-266
• /
• 2011

The rapid development of airlines, has made airports busier and more complicated. The assignment of scheduled to available gates is a major issue for daily airline operations. We consider the over-constrained airport gate assignment problem(AGAP) where the number of flights exceeds the number of available gates, and where the objectives are to minimize the number of ungated flights and the total walking distance or connection times. The procedures used in this project are to create a mathematical model formulation to identify decision variables to identify, constraints and objective functions. In addition, we will consider in the AGAP the size of each gate in the terminal and also the towing process for the aircraft. We will use a greedy algorithm to solve the problem. The greedy algorithm minimizes ungated flights while providing initial feasible solutions that allow flexibility in seeking good solutions, especially in case when flight schedules are dense in time. Experiments conducts give good results.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.5 no.1
• /
• pp.207-216
• /
• 1997

We developed the durability estimation and design systems to minimize the volume, considering the durability, efficiency, and design requirements of worm gears. That is, we consider each kind of factors affecting on durability on the basis of AGMA Standard for the cylindrical and double-enveloping worm gears. We also estimate input power on the basis of wear and durability, bending strength and deflection of worm shaft, and we developed the durability estimation and design systems of power transmission worm gears introducing the optimal design method on the personal computer to be easily used in field. Also, we developed a method which converts the design variables obtained from the optimal design method to integer values(number of worm threads, number of worm threads, number of worm wheel teeth, etc.,) to be used in real design and production. The developed durability estimation and design method can be easily applied to the design of worm gears used as power transmission devices in machineries and is expected to be used for weight minimization of worm gear unit.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.5
• /
• pp.382-393
• /
• 1991

In this paper, we propose a method for recognizing printed Korean characters using the Preceding Layer Driven multi-layer perceptron. The new learning algorithm which assigns the weight values to an integer and makes use of the transfer function as the step function was presented to design the hardware. We obtained 522 Korean character-image as an experimental object through scanner with 600DPI resolution. The preprocessing for feature extraction of Korean character is the separation of individual character, noise elimination smoothing, thinnig, edge point extraction, branch point extraction, and stroke segmentation. The used feature data are the number of edge points and their shapes, the number of branch points, and the number of strokes with 8 directions.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.6
• /
• pp.1341-1354
• /
• 2021

Let r ≥ 2, and let k_i ≥ 2 for 1 ≤ i ≤ r. Mixed van der Waerden's theorem states that there exists a least positive integer w = w(k₁, k₂, k₃, …, k_r; r) such that for any n ≥ w, every r-colouring of [1, n] admits a k_i-term arithmetic progression with colour i for some i ∈ [1, r]. For k ≥ 3 and r ≥ 2, the mixed van der Waerden number w(k, 2, 2, …, 2; r) is denoted by w₂(k; r). B. Landman and A. Robertson [9] showed that for k < r < $\frac{3}{2}$(k - 1) and r ≥ 2k + 2, the inequality w₂(k; r) ≤ r(k - 1) holds. In this note, we establish some results on w₂(k; r) for 2 ≤ r ≤ k.

• Korean Journal of Mathematics
• /
• v.30 no.2
• /
• pp.391-402
• /
• 2022

For a given graph G = (V, E), a dominating set is a subset V' of the vertex set V so that each vertex in V ＼ V' is adjacent to a vertex in V'. The minimum cardinality of a dominating set of G is called the domination number of G and is denoted by γ(G). For an integer k ≥ 1, the k-th power G^k of a graph G with V (G^k) = V (G) for which uv ∈ E(G^k) if and only if 1 ≤ d_G(u, v) ≤ k. Note that G² is the square graph of a graph G. In this paper, we obtain some tight bounds for the sum of the domination numbers of a graph and its square graph in terms of the order, order and size, and maximum degree of the graph G. Also, we characterize such extremal graphs.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.259-267
• /
• 2005

In 2000 a general conjecture was proposed: a special polygon cannot be cut into an odd number of triangles of equal areas. It has been proved that the conjecture holds for polygons with at most six sides. In this paper we prove the existence of special n-polygon for any integer n > 6 and discuss the conjecture for special polygons with seven sides.

• Bulletin of the Korean Mathematical Society
• /
• v.41 no.1
• /
• pp.109-116
• /
• 2004

In this paper, we study the uniqueness of entire functions and prove the following result: Let f(z) and g(z) be two nonconstant entire functions, $n\;{\geq}\;7$ a positive integer, and let a be a nonzero finite complex number. If $f^{n}(z)(f(z)\;-\;1)f'(z)\;and\;g^{n}(z)(g(z)\;-\;1)g'(z)$ share a CM, then $f(z)\;{\equiv}\;g(z)$. The result improves the theorem due to ref. [3].

• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.4
• /
• pp.907-913
• /
• 2013

In this paper, we prove the generalized Hyers-Ulam stability of the additive functional inequality $${\parallel}f(2x_1)+f(2x_2)+{\cdots}+f(2x_n){\parallel}{\leq}{\parallel}tf(x_1+x_2+{\cdots}+x_n){\parallel}$$ in Banach spaces where a positive integer $n{\geq}3$ and a real number t such that 2${\leq}$t

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.12
• /
• pp.72-80
• /
• 1998

In this study, a design approach based on genetic algorithm is proposed to solve the manufacturing cell design problem considering alternative process plans and alternative machines. The problem is formulated as a 0-1 integer programming model which considers several manufacturing parameters, such as demand and processing time of part, machine capacity, manufacturing cell size, and the number of machines in a machine cell. A genetic algorithm is used to determine process plan for each part, part family and machine cell simultaneously.

• Journal of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.651-655
• /
• 1996

Lagrange's famous Four Square Theorem [L] says that every positive integer can be represented by the sum of four squares. This marvelous theorem was generalized by Mordell [M1] and Ko [K1] as follows : every positive definite integral quadratic form of two, three, four, and five variables is represented by the sum of five, six, seven, and eight squares, respectively. And they tried to extend this to positive definite integral quadratic forms of six or more variables.