Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of the Korea Society for Industrial and Applied Mathematics
Journal Basic Information
Journal DOI :
The Korean Society for Industrial and Applied Mathematics
Editor in Chief :
Volume & Issues
Volume 11, Issue 4 - Dec 2007
Volume 11, Issue 3 - Sep 2007
Volume 11, Issue 2 - Jun 2007
Volume 11, Issue 1 - Mar 2007
Selecting the target year
AN APPROXIMATION SCHEME FOR A GEOMETRICAL NP-HARD PROBLEM
Kim, Joon-Mo ;
Journal of the Korea Society for Industrial and Applied Mathematics, volume 11, issue 4, 2007, Pages 1~8
In some wireless sensor networks, the sensor nodes are required to be located sparsely at designated positions over a wide area, introducing the problem of adding minimum number of relay nodes to interconnect the sensor nodes. The problem finds its a bstract form in literature: the Minimum number of Steiner Points. Since it is known to be NP-hard, this paper proposes an approximation scheme to estimate the minimum number of relay nodes through the properties of the abstract form. Note that by reducing the numb er of nodes in a sensor network, the amount of data exchange over the net will be far decreased.
ARARO: Aggregate Router-Assisted Route Optimization for Mobile Network Support
Rho, Kyung-Taeg ; Jung, Soo-Mok ;
Journal of the Korea Society for Industrial and Applied Mathematics, volume 11, issue 4, 2007, Pages 9~17
Network Mobility basic support protocol (NEMO Basic) extends the operation of Mobile IPv6 to provide uninterrupted Internet connectivity to the communicating nodes of mobile networks. The protocol uses a mobile router (MR) in the mobile network to perform prefix scope binding updates with its home agent (HA) to establish a bi-directional tunnel between the HA and MR. This solution reduces location-update signaling by making network movements transparent to the mobile nodes (MNs) behind the MR. However, delays in data delivery and higher overheads are likely to occur because of sub-optimal routing and multiple encapsulation of data packets. To manage the mobility of the mobile network, it is important to minimize packet overhead, to optimize routing, and to reduce the volume of handoff signals over the nested mobile network. This paper proposes en aggregate router-assisted route optimization (ARARO) scheme for nested mobile networks support which introduces a local anchor router in order to localize handoff and to optimize routing. With ARARO, a mobile network node (MNN) behind a MR performs route optimization with a correspondent node (CN) as the MR sends a binding update message (BU) to aggregate router (AGR) via root-MR on behalf of all active MNNs when the mobile network moves. This paper describes the new architecture and mechanisms and provides simulation results which indicate that our proposal reduces transmission delay, handoff latency and signaling overhead. To evaluate the scheme, we present the results of simulation.
APPLICATIONS OF GRAPH THEORY
Pirzada, S. ; Dharwadker, Ashay ;
Journal of the Korea Society for Industrial and Applied Mathematics, volume 11, issue 4, 2007, Pages 19~38
Graph theory is becoming increasingly significant as it is applied of mathematics, science and technology. It is being actively used in fields as varied as biochemistry(genomics), electrical engineering(communication networks and coding theory), computer science(algorithms and computation) and operations research(scheduling). The powerful results in other areas of pure mathematics. Rhis paper, besides giving a general outlook of these facts, includes new graph theoretical proofs of Fermat's Little Theorem and the Nielson-Schreier Theorem. New applications to DNA sequencing (the SNP assembly problem) and computer network security (worm propagation) using minimum vertex covers in graphs are discussed. We also show how to apply edge coloring and matching in graphs for scheduling (the timetabling problem) and vertex coloring in graphs for map coloring and the assignment of frequencies in GSM mobile phone networks. Finally, we revisit the classical problem of finding re-entrant knight's tours on a chessboard using Hamiltonian circuits in graphs.
Solving a Matrix Polynomial by Conjugate Gradient Methods
Ko, Hyun-Ji ; Kim, Hyun-Min ;
Journal of the Korea Society for Industrial and Applied Mathematics, volume 11, issue 4, 2007, Pages 39~46
One of well known and much studied nonlinear matrix equations is the matrix polynomial which has the form G(X)=
and X are
real matrices. We show how the minimization methods can be used to solve the matrix polynomial G(X) and give some numerical experiments. We also compare Polak and Ribi
re version and Fletcher and Reeves version of conjugate gradient method.
SOME COMPUTATIONS AND EXTREMAL PROPERTIES OF OPERATORS
Moon, Kyung-Young ; Park, Sun-Hyun ;
Journal of the Korea Society for Industrial and Applied Mathematics, volume 11, issue 4, 2007, Pages 47~54
In  some computation of spectral measures induced by normal operators
was introduced. In this note we improve some computations by using spectral measures, which are related t o extremal vectors. Also, we discuss the extremal value properties and apply our spectral measure equations to moment sequences which are induced by weighted shifts.
ANALYSIS OF FIRST-ORDER SYSTEM LEAST-SQUARES FOR THE OPTIMAL CONTROL PROBLEMS FOR THE NAVIER-STOKES EQUATIONS
Choi, Young-Mi ; Kim, Sang-Dong ; Lee, Hyung-Chun ; Shin, Byeong-Chun ;
Journal of the Korea Society for Industrial and Applied Mathematics, volume 11, issue 4, 2007, Pages 55~68
First-order least-squares method of a distributed optimal control problem for the incompressible Navier-Stokes equations is considered. An optimality system for the optimal solution are reformulated to the equivalent first-order system by introducing velocity-flux variables and then the least-squares functional corresponding to the system is defined in terms of the sum of the squared
norm of the residual equations of the system. The optimal error estimates for least-squares finite element approximations are obtained.
New large-update primal interior point algorithms based on kernel functions for LCPs
Kim, Min-Kyung ; Cho, Gyeong-Mi ;
Journal of the Korea Society for Industrial and Applied Mathematics, volume 11, issue 4, 2007, Pages 69~88
In this paper we propose new large-update primal-dual interior point algorithms for
linear complementarity problems(LCPs). New search directions and proximity measures are proposed based on a specific class of kernel functions,
, which are the generalized form of the ones in  and . It is the first to use this class of kernel functions in the complexity analysis of interior point method(IPM) for
LCPs. We showed that if a strictly feasible starting point is available, then new large-update primal-dual interior point algorithms for
LCPs have the best known complexity
when p=1 and
Upper and lower solutions for a singular p-Laplacian system
Kim, Chan-Gyun ; Lee, Eun-Kyoung ;
Journal of the Korea Society for Industrial and Applied Mathematics, volume 11, issue 4, 2007, Pages 89~99
In this paper, we define the upper and lower solutions for a p-Laplacian system with singular nonlinearity at the boundaries. And we prove the theorem for the upper and power solutions method.