• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.4
• /
• pp.99-108
• /
• 2001

In the ring loading problem with demand splitting, traffic demands are given for each pall of nodes in an undirected ring network and a flow is routed in either of the two directions, clockwise and counter-clockwise. The load of a link is the sum of the flows routed through the link and the objective of the problem is to minimize the maximum load on the ring. The fastest a1gorithm to date is Myung, Kim and Tcha＇s a1gorithm that runs in Ο(n｜K｜) time where n is the number of nodes and K is the index set of the origin-destination pairs of nodes having flow traffic demands. Here we develop an a1gorithm for the ring loading problem with demand splitting that improves the rerouting step of Myung, Kim and Tcha＇s a1gorithm arid runs in Ο(min{n｜K｜, n$^2$}) time.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.3
• /
• pp.67-75
• /
• 1993

In many practical applications of systolic array, it is common that the problem size(n) is larger than the array size(M). In this case, the problem has to be partitioned into block to fit into the array before it is processed. This paper presents a problem partition method for dynamic programming and 2-dimensional systolic array suitable for it. Designed array has two types of array configur-ation for processing the partitioned problem. The queue is designed for storing and recirculating the intermediate results in the correct location and time. The number of processing elements and queues required are M(3M+1)/2, 4M respectively. The total processing time is 2(M+1)+(n+10M+3)(n/M-1)(n/M-1)/6.

• Journal of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.949-970
• /
• 2007

By considering a bridge between Bram-Halmos and Embry characterizations for the subnormality of cyclic operators, we extend the Curto-Fialkow and Embry truncated complex moment problem, and solve the problem finding the finitely atomic representing measure ${\mu}$ such that ${\gamma}_{ij}={\int}\bar{z}^iz^jd{\mu},\;(0{\le}i+j{\le}2n,\;|i-j|{\le}n+s,\;0{\le}s{\le}n);$ the cases of s = n and s = 0 are induced by Bram-Halmos and Embry characterizations, respectively. The former is the Curto-Fialkow truncated complex moment problem and the latter is the Embry truncated complex moment problem.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.5
• /
• pp.1631-1637
• /
• 2013

This paper generalizes the Aleksandrov problem and Mazur Ulam theorem to the case of $n$-normed spaces. For real $n$-normed spaces X and Y, we will prove that $f$ is an affine isometry when the mapping satisfies the weaker assumptions that preserves unit distance, $n$-colinear and 2-colinear on same-order.

• Journal of the Korean Statistical Society
• /
• v.25 no.2
• /
• pp.185-193
• /
• 1996

In this paper we consider the gambler's ruin problem with N players and derive the formula for computing the expected ruin time when the initial fortunes of all N players are the same. And we present an example for the case of N = 5.

• Korean Journal of Human Ecology
• /
• v.16 no.3
• /
• pp.491-504
• /
• 2007

This study was based on resilience approach to find out elementary first, second, and third year students' differences of social support and problem solving ability defending on their family situation (low-income divorced family or normal family) by comparing their sex and age. In addition, the purpose of this study was to find out the effect of factors (social support, problem behavior, and problem solving ability) of children defending on their family situation and age. Moreover, it was aimed to find out the effect of social support and problem solving ability of low-income divorced family's children on their problem behavior. Subjects were 165 children in elementary school (grade 1, 2, and 3). For this study two groups were used for comparison. First, low-grade elementary school children with low-income divorced parents (N=87), "group D" and second, with low-income non-divorced parents (N=78) "group N". The questionnaire, picture cards, and teacher's report was used to determine social support perception, problem-solving ability, and problem behavior, respectively. Results showed that "Group D" was determined to show regarding social support, problem-solving ability, and problem behaviors worse than "group N". In conclusion, problem behaviors of "group D" were affected by social support and their problem-solving ability.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.773-775
• /
• 2013

In this paper, we consider the problem for finding a vertex sequence of the directed cycle graph from the individual neighborhood information on a reconfigurable mesh(in short, RMESH). This problem can be solved in linear time using a sequential algorithm. However, it is difficult to develop a sublinear time parallel algorithm for the problem because of its sequential nature. All kinds of polygons can be represented by directed cycles, hence a solution of the problem may be used to solving problems in which a polygon should be constructed from the adjacency information for each vertex. In this paper, we present a constant time $n{\times}n^2$ RMESH algorithm for the problem with n vertices.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1847-1852
• /
• 2004

This article provides the connection between feedback stabilization and interpolation conditions for n-D linear systems (n > 1). In addition to internal stability, if one demands performance as a design goal, then there results an n-D matrix Nevanlinna-Pick interpolation problem. Application of recent work on Nevanlinna-Pick interpolation on the polydisk yields a solution of the problem for the 2-D case. The same analysis applies in the n-D case (n > 2), but leads to solutions which are contractive in a norm (the "Schur-Agler norm") somewhat stronger than the $H^{\infty}$ norm. This is an analogous version of the connection between the standard $H^{\infty}$ control problem and an interpolation problem of Nevanlinna-Pick type in the classical 1-D linear time-invariant systems.

• Communications of the Korean Mathematical Society
• /
• v.17 no.2
• /
• pp.321-330
• /
• 2002

Consider the random assignment (or bipartite matching) problem with iid uniform edge costs t(i, j). Let $A_{n}$ be the optimal assignment cost. Just recently does Aldous [2] give a rigorous proof that E $A_{n}$ longrightarrowζ(2). In this paper we establish the upper and lower bounds for Var $A_{n}$ , i.e., there exist two strictly positive but finite constants $C_1$ and $C_2$ such athat $C_1$ $n^{(-5}$2)/ (log n)$^{(-3}$2)/ $\leq$ Var $A_{n}$ $\leq$ $C_2$ $n^{-1}$ (log n)$^2$.EX>.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.167-182
• /
• 2007

The existence of solutions of the following multi-point boundary value problem $${x^{(n)}(t)=f(t,\;x(t),\;x'(t),{\cdots}, x^{(n-2)}(t))+r(t),\;0 is studied. Sufficient conditions for the existence of at least one solution of BVP(*) are established. It is of interest that the growth conditions imposed on f are allowed to be super-linear (the degrees of phases variables are allowed to be greater than 1 if it is a polynomial). The results are different from known ones since we don't apply the Green's functions of the corresponding problem and the method to obtain a priori bounds of solutions are different enough from known ones. Examples that can not be solved by known results are given to illustrate our theorems.