• Journal of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.135-148
• /
• 1998

We propose the new controls constructed via the second or direct method of Liapunov to solve the collision avoidance control problems for moving objects and a robot arm in the plane. We also explicate the controlling effect by the simulations.

• Journal of the Korean Mathematical Society
• /
• v.35 no.1
• /
• pp.225-234
• /
• 1998

We compute genus distributions for bouquets of dipoles by using the method concerning the cycle structure of permutations in the symmetric group. From this, we can deduce that every bouquet of dipoles is upper embeddable. We find a foumula for computing the embedding polynomials for bouquets of dipoles.

• Communications of the Korean Mathematical Society
• /
• v.18 no.4
• /
• pp.745-754
• /
• 2003

Maximum clique problem is to find a maximum clique(largest in size) in an undirected graph G. We present a method that computes either a maximum clique or an upper bound for the size of a maximum clique in G. We show that this method performs well on certain class of graphs and discuss the application of this method in a branch and bound algorithm for solving maximum clique problem, whose efficiency is depended on the computation of good upper bounds.

• Communications of the Korean Mathematical Society
• /
• v.24 no.4
• /
• pp.617-628
• /
• 2009

We present an efficient and accurate finite-difference method for computing Black-Scholes partial differential equations with multiunderlying assets. We directly solve Black-Scholes equations without transformations of variables. We provide computational results showing the performance of the method for two underlying asset option pricing problems.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.2
• /
• pp.491-499
• /
• 2019

The problem of finding fast computing methods for Bernoulli numbers has a long and interesting history. In this paper, the author provides new proofs for two lacunary recurrence relations with gaps of length four and eight for the Bernoulli numbers. These proofs invoked the fact that the nth powers of ${\pi}^2$, ${\pi}^4$ and ${\pi}^8$ can be expressed in terms of the nth elementary symmetric functions.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.1
• /
• pp.113-132
• /
• 2021

We show that if a divisor centered over a point on a smooth surface computes a minimal log discrepancy, then the divisor also computes a log canonical threshold. To prove the result, we study the asymptotic log canonical threshold of the graded sequence of ideals associated to a divisor over a variety. We systematically study this invariant and prove a result describing which divisors compute asymptotic log canonical thresholds.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3916-3936
• /
• 2014

Smartphone applications like games, image processing, e-commerce and social networking are gaining exponential growth, with the ubiquity of cellular services. This demands increased computational power and storage from mobile devices with a sufficiently high bandwidth for mobile internet service. But mobile nodes are highly constrained in the processing and storage, along with the battery power, which further restrains their dependability. Adopting the unlimited storage and computing power offered by cloud servers, it is possible to overcome and turn these issues into a favorable opportunity for the growth of mobile cloud computing. As the mobile internet data traffic is predicted to grow at the rate of around 65 percent yearly, even advanced services like 3G and 4G for mobile communication will fail to accommodate such exponential growth of data. On the other hand, developers extend popular applications with high end graphics leading to smart phones, manufactured with multicore processors and graphics processing units making them unaffordable. Therefore, to address the need of resource constrained mobile nodes and bandwidth constrained cellular networks, the computations can be migrated to resourceful servers connected to cloud. The server now acts as a bridge that should enable the participating mobile nodes to offload their computations through Wi-Fi directly to the virtualized server. Our proposed model enables an on-demand service offloading with a decision support system that identifies the capabilities of the client's hardware and software resources in judging the requirements for offloading. Further, the node's location, context and security capabilities are estimated to facilitate adaptive migration.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.809-823
• /
• 2015

This paper is devoted to presenting a MacWilliams type identity for m-spotty RT weight enumerators of byte error control codes over finite commutative Frobenius rings, which can be used to determine the error-detecting and error-correcting capabilities of a code. This provides the relation between the m-spotty RT weight enumerator of the code and that of the dual code. We conclude the paper by giving three illustrations of the results.

• Journal of the Korean Mathematical Society
• /
• v.48 no.5
• /
• pp.939-952
• /
• 2011

This paper is concerned with the solution of ill-conditioned Systems of Linear Equations (SLE's) via the solution of equivalent SLE's which are well-conditioned. A matrix is rst constructed from that of the given ill-conditioned system. Then, an adequate right-hand side is computed to make up the instance of an equivalent system. Formulae and algorithms for computing an instance of this equivalent SLE and solving it will be given and illustrated.

• Journal of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.591-605
• /
• 2013

The underlying field is of characteristic $p$ > 2. In this paper, we first use the method of computing the homogeneous derivations to determine the first cohomology of the so-called odd contact Lie algebra with coefficients in the even part of the generalized Witt Lie superalgebra. In particular, we give a generating set for the Lie algebra under consideration. Finally, as an application, the derivation algebra and outer derivation algebra of the Lie algebra are completely determined.