• Kyungpook Mathematical Journal
• /
• v.53 no.2
• /
• pp.273-283
• /
• 2013

In this paper, we consider the row rank inequalities derived from comparisons of the row ranks of the additions and multiplications of nonnegative integer matrices and construct the sets of nonnegative integer matrix pairs which is occurred at the extreme cases for the row rank inequalities. We characterize the linear operators that preserve these extreme sets of nonnegative integer matrix pairs.

• Communications for Statistical Applications and Methods
• /
• v.13 no.2
• /
• pp.343-358
• /
• 2006

The distributional properties of forecasts in an integer-valued time series model have not been discovered yet mainly because of the complexity arising from the binomial thinning operator. We propose two bootstrap methods to obtain nonparametric prediction intervals for an integer-valued autoregressive model : one accommodates the variation of estimating parameters and the other does not. Contrary to the results of the continuous ARMA model, we show that the latter is better than the former in forecasting the future values of the integer-valued autoregressive model.

• The Pure and Applied Mathematics
• /
• v.30 no.3
• /
• pp.269-288
• /
• 2023

In this paper we study the effect of integer translation on Nevanlinna's characteristic function of a meromorphic function. Also, we investigate comparative growth of integer translated entire and meromorphic functions under different conditions.

• Honam Mathematical Journal
• /
• v.38 no.2
• /
• pp.279-294
• /
• 2016

Half integer values of harmonic numbers and reciprocal binomial squared coeffients sums are investigated in this paper. Closed form representations and integral expressions are developed for the infiite series.

• Communications of the Korean Mathematical Society
• /
• v.11 no.2
• /
• pp.335-348
• /
• 1996

For an open set G in the complex plane C, we prove the existence of an entire function f such that its integer translations forms a finitely normal family exactly on G if and only if G is periodic with period 1 and G has no hole.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.2
• /
• pp.117-122
• /
• 1992

We consider 0-1 mixed integer knapsack problems. They turn out to be no more difficult to solve than the corresponding 0-1 pure integer knapsack problems with efficient pseudopolynomial time algorithm.

• Management Science and Financial Engineering
• /
• v.16 no.1
• /
• pp.47-57
• /
• 2010

We present a new integer programming formulation and a class of valid inequalities for solving the one-dimensional facility layout problem, which leads to a very efficient solution method for the problem.

• Kyungpook Mathematical Journal
• /
• v.56 no.2
• /
• pp.611-624
• /
• 2016

This paper gives for every positive integer n an explicit construction of a graph G with fewer than $15{\log}^2n-{\frac{5}{2}}{\log}n+28$ vertices, such that there exists a nontrivial factoring of n if and only if G is 3-colorable.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.11 no.3
• /
• pp.1-5
• /
• 2007

We give an elementary proof of a necessary and sufficient condition for integer translates {${\phi}(t-{\alpha})\;:\;{\alpha}{\in}{\mathbb{Z}}^d$} of ${\phi}$(t) in $L^2({\mathbb{R}}^d)$ to be a frame sequence.

• Journal of Advanced Navigation Technology
• /
• v.11 no.4
• /
• pp.388-393
• /
• 2007

In designing transform coders bit allocation is one of the important issues. In this paper we propose two optimal algorithms for integer bit allocation in transform coding. Based on high-resolution formulas for bit allocation, the most and least greedy algorithms are developed to optimally adjust non-integer bit rates of coefficient quantizers to integer values. In particular, a duality property is observed between the two greedy algorithms.