• Structural Engineering and Mechanics
• /
• v.62 no.4
• /
• pp.431-441
• /
• 2017

In this article, an analytical-numerical approach is presented in order to determine the dynamic response of thin plates resting on multiple elastic point supports with time-varying stiffness. The proposed method is essentially based on transforming a familiar governing partial differential equation into a new solvable system of linear ordinary differential equations. When dealing with time-invariant stiffness, the solution of this system of equations leads to a symmetric matrix, whose eigenvalues determine the natural frequencies of the point-supported plate. Moreover, this method proves to be applicable for any plate configuration with any type of boundary condition. The results, where possible, are verified upon comparison with available values in the literature, and excellent agreement is achieved.

• IE interfaces
• /
• v.13 no.4
• /
• pp.556-563
• /
• 2000

In this paper, we consider wavelength assignment problem (WAP) in Wavelength division multiplexed (WDM) unidirectional optical telecommunication ring networks. We show that, even though WAP on unidirectional ring belongs to NP-hard, WAP can be exactly solvable in real-sized WDM rings for near future demand. To accomplish this, we convert WAP to the vertex coloring problem of the related graph and choose a special integer programming formulation for the vertex coloring problem. We use a column generation technique in a branch-and-price framework for the suggested formulation. We also propose some generic heuristics and do the performance comparison with the suggested optimization algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.4
• /
• pp.141-146
• /
• 2004

This research considers the problem of scheduling jobs on unrelated parallel machines with a common due date. The objective is to minimize the total absolute deviation of job completion times about the common due date. This problem is motivated by the fact that a certain phase of printed circuit board manufacturing and other production systems is bottleneck and the processing speeds of parallel machines in this phase are different for each job. A zero-one integer programming formulation is presented and two dominance properties are proved. By these dominance properties, it is shown that the problem is reduced to asymmetric assignment problem and is solvable in polynomial time.

• Journal of the Korean Mathematical Society
• /
• v.58 no.6
• /
• pp.1407-1419
• /
• 2021

The Iwasawa decomposition NAK of the Lie group G = SO₀(2, 1) with a left invariant metric produces Riemannian submersions G → N\G, G → A\G, G → K\G, and G → NA\G. For each of these, we calculate the curvature of the base space and the lifting of a simple closed curve to the total space G. Especially in the first case, the base space has a constant curvature 0; the holonomy displacement along a (null-homotopic) simple closed curve in the base space is determined only by the Euclidean area of the region surrounded by the curve.

• ETRI Journal
• /
• v.43 no.2
• /
• pp.344-356
• /
• 2021

CRAFT is a tweakable block cipher introduced in 2019 that aims to provide strong protection against differential fault analysis. In this paper, we show that CRAFT is vulnerable to side-channel cube attacks. We apply side-channel cube attacks to CRAFT with the Hamming weight leakage assumption. We found that the first half of the secret key can be recovered from the Hamming weight leakage after the first round. Next, using the recovered key bits, we continue our attack to recover the second half of the secret key. We show that the set of equations that are solvable varies depending on the value of the key bits. Our result shows that 99.90% of the key space can be fully recovered within a practical time.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.23 no.1
• /
• pp.1-18
• /
• 2019

In contrast to the well-developed convex splitting schemes for gradient flows of two-component system, there were few efforts on applying the convex splitting idea to gradient flows of multi-component system, such as the vector-valued Cahn-Hilliard (vCH) equation. In the case of the vCH equation, one need to consider not only the convex splitting idea but also a specific method to manage the partition of unity constraint to design an unconditionally energy stable scheme. In this paper, we propose a constrained Convex Splitting (cCS) scheme for the vCH equation, which is based on a convex splitting of the energy functional for the vCH equation under the constraint. We show analytically that the cCS scheme is mass conserving and unconditionally uniquely solvable. And it satisfies the constraint at the next time level for any time step thus is unconditionally energy stable. Numerical experiments are presented demonstrating the accuracy, energy stability, and efficiency of the proposed cCS scheme.

• Kyungpook Mathematical Journal
• /
• v.61 no.3
• /
• pp.661-669
• /
• 2021

For a simple, undirected graph G = (V, E), a perfect Roman dominating function (PRDF) f : V → {0, 1, 2} has the property that, every vertex u with f(u) = 0 is adjacent to exactly one vertex v for which f(v) = 2. The weight of a PRDF is the sum f(V) = ∑_v∈V f(v). The minimum weight of a PRDF is called the perfect Roman domination number, denoted by γ_R^P(G). Given a graph G and a positive integer k, the PRDF problem is to check whether G has a perfect Roman dominating function of weight at most k. In this paper, we first investigate the complexity of PRDF problem for some subclasses of bipartite graphs namely, star convex bipartite graphs and comb convex bipartite graphs. Then we show that PRDF problem is linear time solvable for bounded tree-width graphs, chain graphs and threshold graphs, a subclass of split graphs.

• Journal of the Korean Mathematical Society
• /
• v.60 no.1
• /
• pp.115-141
• /
• 2023

We study a class of left-invariant pseudo-Riemannian Sasaki metrics on solvable Lie groups, which can be characterized by the property that the zero level set of the moment map relative to the action of some one-parameter subgroup {exp tX} is a normal nilpotent subgroup commuting with {exp tX}, and X is not lightlike. We characterize this geometry in terms of the Sasaki reduction and its pseudo-Kähler quotient under the action generated by the Reeb vector field. We classify pseudo-Riemannian Sasaki solvmanifolds of this type in dimension 5 and those of dimension 7 whose Kähler reduction in the above sense is abelian.

• Kyungpook Mathematical Journal
• /
• v.63 no.2
• /
• pp.167-173
• /
• 2023

Let G be a finite group and let ν(G) be the probability that two randomly selected elements of G produce a nilpotent group. In this article we show that for every positive integer n > 0, there is a finite group G such that ${\nu}(G)={\frac{1}{n}}$. We also classify all groups G with ${\nu}(G)={\frac{1}{2}}$. Further, we prove that if G is a solvable nonnilpotent group of even order, then ${\nu}(G){\leq}{\frac{p+3}{4p}}$, where p is the smallest odd prime divisor of |G|, and that equality exists if and only if $\frac{G}{Z_{\infty}(G)}$ is isomorphic to the dihedral group of order 2p where Z_∞(G) is the hypercenter of G. Finally we find an upper bound for ν(G) in terms of |G| where G ranges over all groups of odd square-free order.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.28 no.1
• /
• pp.22-32
• /
• 2024

In this paper we present a method of conic section approximation by hexic Bézier curves. The hexic Bézier approximants are G³ Hermite interpolations of conic sections. We show that there exists at least one hexic Bézier approximant for each weight of the conic section The hexic Bézier approximant depends one parameter and it can be obtained by solving a quartic polynomial, which is solvable algebraically. We present the explicit upper bound of the Hausdorff distance between the conic section and the hexic Bézier approximant. We also prove that our approximation method has the maximal order of approximation. The numerical examples for conic section approximation by hexic Bézier curves are given and illustrate our assertions.