• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.402-408
• /
• 2002

Multicast technology allows the transmission of data from one source node to a selected group of destination nodes. Multicast routes typically use trees, called multicast routing trees, to minimize resource usage such as cost and bandwidth by sharing links. Moreover, the quality of service (QoS) is satisfied by distributing data along a path haying no more than a given number of arcs between the root node of a session and a terminal node of it in the routing tree. Thus, a multicast routing tree for a session can be represented as a hop constrained Steiner tree. In this paper, we consider the hop-constrained multicast route packing problem with bandwidth reservation. Given a set of multicast sessions, each of which has a hop limit constraint and a required bandwidth, the problem is to determine a set of multicast routing trees in an arc-capacitated network to minimize cost. We propose an integer programming formulation of the problem and an algorithm to solve it. An efficient column generation technique to solve the linear programming relaxation is proposed, and a modified cover inequality is used to strengthen the integer programming formulation.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.10a
• /
• pp.51-67
• /
• 2004

World Wide Web is nearly ubiquitous and the tremendous growing number of Web information strongly requires a structuring framework by which an overview visualization of Web sites has provided as a visual surrogate for the users. We have a viewpoint that the Web site is a directed graph with nodes and arcs where the nodes correspond to Web pages and the arcs correspond to hypertext links between the Web pages. In dealing with the WWW, the goal in this paper is not to derive a naive shortest path or a fast access method, but to generate an optimal structure based on the context centric weight. We modeled a Web site formally so that a integer programming model can be formulated. Even if changes such as modification of the query terms, the optimized Web site structure can be maintained in terms of sensitivity.

• ETRI Journal
• /
• v.28 no.5
• /
• pp.631-637
• /
• 2006

In this paper we study the optimization issues of ring networks employing novel parallel multi-granularity hierarchical optical add-drop multiplexers (OADMs). In particular, we attempt to minimize the number of control elements for the off-line case. We present an integer linear programming formulation to obtain the lower bound in optimization, and propose an efficient heuristic algorithm called global bandwidth resource assignment that is suitable for the design of large-scale OADM networks.

• Kyungpook Mathematical Journal
• /
• v.56 no.3
• /
• pp.647-655
• /
• 2016

Let H be a graph, and $k{\geq}{\chi}(H)$ an integer. We say that H has a cyclic Gray code of k-colourings if and only if it is possible to list all its k-colourings in such a way that consecutive colourings, including the last and the first, agree on all vertices of H except one. The Gray code number of H is the least integer $k_0(H)$ such that H has a cyclic Gray code of its k-colourings for all $k{\geq}k_0(H)$. For complete bipartite graphs, we prove that $k_0(K_{\ell},r)=3$ when both ${\ell}$ and r are odd, and $k_0(K_{\ell},r)=4$ otherwise.

• Journal of the Korean Society for Railway
• /
• v.8 no.6 s.31
• /
• pp.602-609
• /
• 2005

In this paper, we consider the train-fleet assignment problem to determine fleet assignment and seat allocation synchronously. An integer programming model of the problem and a decomposition-based solution approach are developed to handle short-term period deterministic orgin-destination demands. The primary objective used in the developed model is to maximize the total number of passengers transported during peak load periods, such as Chuseok national holiday period. Thus, in developing the model we choose to profit-pursuing system. We also show how the proposed model can be readily modified to incorporate profit-maximization. Using the empirical data sets provided by a Korean railroad company, we have tested the proposed solution approach and carried out various comparison analyses by varying traffic demand patterns and train schedules. The computational experiments reveal that the proposed solutions approach produces high quality solutions in reasonable computation time.

• Journal of Information Technology Services
• /
• v.10 no.1
• /
• pp.117-133
• /
• 2011

In this paper, we present a frequency reassignment problem (FRP) arising from the reconfiguration of radio networks such as adding new base stations (BSs) and changing the number of frequencies assigned to BSs. For this problem, we develop an integer programming (IP) model that minimizes the sum of frequency reassignment cost and the cost for unsatisfied frequency demands, while avoiding interference among frequencies. To obtain tight lower bounds, we develop some valid inequalities and devise an objective function relaxation scheme. Also, we develop a simple but efficient heuristic procedure to solve large size problems. Computational results show that the developed valid inequalities are effective for improving lower bounds. Also, the proposed tabu search heuristic finds tight upper bounds with average optimality gap of 2.3%.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.2
• /
• pp.487-494
• /
• 2016

Let p be an odd prime and c be a fixed integer with (c, p) = 1. For each integer a with $1{\leq}a{\leq}p-1$, it is clear that there exists one and only one b with $0{\leq}b{\leq}p-1$ such that $ab{\equiv}c$ mod p. Let N(c, p) denote the number of all solutions of the congruence equation $ab{\equiv}c$ mod p for $1{\leq}a$, $b{{\leq}}p-1$ in which a and $\bar{b}$ are of opposite parity, where $\bar{b}$ is defined by the congruence equation $b{\bar{b}}{\equiv}1$ mod p. The main purpose of this paper is using the mean value theorem of Dirichlet L-functions and the properties of Gauss sums to study the computational problem of one kind mean value function related to $E(c,p)=N(c,p)-{\frac{1}{2}}{\phi}(p)$, and give its an exact computational formula.

• East Asian mathematical journal
• /
• v.37 no.5
• /
• pp.613-617
• /
• 2021

Abstract. For a positive square-free integer m, let K = ℚ($\sqrt{m}$) be a real quadratic field. The relative class number H_d(f) of K of discriminant d is the ratio of class numbers 𝒪_K and 𝒪_f, where 𝒪_K is the ring of integers of K and 𝒪_f is the order of conductor f given by ℤ + f𝒪_K. In 1856, Dirichlet showed that for certain m there exists an infinite number of f such that the relative class number H_d(f) is one. But it remained open as to whether there exists such an f for each m. In this paper, we give a result for existence of real quadratic field ℚ($\sqrt{m}$) with relative class number one where the period of continued fraction expansion of $\sqrt{m}$ is 6.

• Kyungpook Mathematical Journal
• /
• v.56 no.2
• /
• pp.349-355
• /
• 2016

For any integer $n{\geq}2$, each palindrome of n induces a circulant graph of order n. It is known that for each integer $n{\geq}2$, there is a one-to-one correspondence between the set of (resp. aperiodic) palindromes of n and the set of (resp. connected) circulant graphs of order n (cf. [2]). This bijection gives a one-to-one correspondence of the palindromes ${\sigma}$ with $gcd({\sigma})=1$ to the connected circulant graphs. It was also shown that the number of palindromes ${\sigma}$ of n with $gcd({\sigma})=1$ is the same number of aperiodic palindromes of n. Let $a_n$ (resp. $b_n$) be the number of aperiodic palindromes ${\sigma}$ of n with $gcd({\sigma})=1$ (resp. $gcd({\sigma}){\neq}1$). Let $c_n$ (resp. $d_n$) be the number of periodic palindromes ${\sigma}$ of n with $gcd({\sigma})=1$ (resp. $gcd({\sigma}){\neq}1$). In this paper, we calculate the numbers $a_n$, $b_n$, $c_n$, $d_n$ in two ways. In Theorem 2.3, we $n_d$ recurrence relations for $a_n$, $b_n$, $c_n$, $d_n$ in terms of $a_d$ for $d{\mid}n$ and $d{\neq}n$. Afterwards, we nd formulae for $a_n$, $b_n$, $c_n$, $d_n$ explicitly in Theorem 2.5.

• The Mathematical Education
• /
• v.50 no.2
• /
• pp.135-148
• /
• 2011

We can say that the history of mathematics is the history on the development of the number system. The number starts from Natural number and is constructed to Integer number and Rational number. The Rational number is not the complete number analytically so that Real number is completed by the idea of the nested interval method. Real number is completed analytically, however, is not by algebra, so the algebraically completed type of the rational number, through the way that similar to the process of completing real number, is Complex number. The purpose of this study is to show the most appropriate way for the development of the human being thinking about the teaching and leaning of Complex number. To do this, We have to consider the proof of the existence of Complex number, the background of the introduction of Complex number and the background knowledge that the teachers to teach Complex number should have. Also, this study analyzes the knowledge to be taught of Complex number based on the anthropological theory of didactics and finally presents the teaching method of Complex number based on this theory.