• Journal of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.413-421
• /
• 1996

A path g in the plane $R^2$ is the sequence of the points $(t_0, t_1, \ldots, t_n)$, with coordinates in $Z^2$. The point $t_0$ is the starting point and the point $t_n$ is the arriving point. An elementary step of g is a couple $(t_i, t_{i+1}), 0 \leq i \leq n - 1$. We denote the length of the path g by $\mid$g$\mid$ = n.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.12
• /
• pp.95-100
• /
• 2017

In this paper, we propose a zone based ad hoc network construction scheme which support ad hoc path between nodes in local IoT networks consisting of IoT devices with the constrained feature, such as low power, the limited transmission rate and low computing capacity. Recently, the various routing protocols have been studied to support ad hoc networking of local IoT environments. This is, because basis RPL protocol is deigned to be used for the connecting service with Internet through gateway, ad hoc path between nodes in local IoT networks is not supported in basis RPL protocol. Thus, in this paper, the proposed routing scheme provides both ad hoc path and Infra path through gateway, supporting basis RPL protocol simultaneously. Through simulation, we show that the proposed routing scheme with zone based path selection scheme improves the performance of the success rate of end-to-end data transmission and the end-to-end delay, compared to basis RPL protocol.

• Journal of the Korean Mathematical Society
• /
• v.45 no.2
• /
• pp.377-392
• /
• 2008

Let X be a real reflexive Banach space with a uniformly $G\hat{a}teaux$ differentiable norm, C a nonempty closed convex subset of X, T : C $\rightarrow$ X a continuous pseudocontractive mapping, and A : C $\rightarrow$ C a continuous strongly pseudocontractive mapping. We show the existence of a path ${x_t}$ satisfying $x_t=tAx_t+(1- t)Tx_t$, t $\in$ (0,1) and prove that ${x_t}$ converges strongly to a fixed point of T, which solves the variational inequality involving the mapping A. As an application, we give strong convergence of the path ${x_t}$ defined by $x_t=tAx_t+(1-t)(2I-T)x_t$ to a fixed point of firmly pseudocontractive mapping T.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1598-1607
• /
• 2016

Safe transmitting monitoring data is essential for supporting IoT-Cloud services efficiently. In this paper, we find ways to configure data path flexibly in SDN based for IoT-Cloud services utilizing SmartX-mini Playground. To do this, we use ONOS(Open Network Operating System) SDN Controller, ONOS NBI Applications made from us to check flexible and safe data path configuration for IoT-Cloud monitoring data transmitting in real IoT-SDN-Cloud environments.

• Journal of the Korea Convergence Society
• /
• v.8 no.7
• /
• pp.15-21
• /
• 2017

Recently, users' interest in IoT related products is increasing as the 4th industrial revolution has become social. The types and functions of sensors used in IoT devices are becoming increasingly diverse, and mutual authentication technology of IoT devices is required. In this paper, we propose an efficient double signature authentication scheme using Pascal's triangle theory so that different types of IoT devices can operate smoothly with each other. The proposed scheme divides the authentication path between IoT devices into two (main path and auxiliary path) to guarantee authentication and integrity of the IoT device. In addition, the proposed scheme is suitable for IoT devices that require a small capacity because they generate keys so that additional encryption algorithms are unnecessary when authenticating IoT devices. As a result of the performance evaluation, the delay time of the IoT device is improved by 6.9% and the overhead is 11.1% lower than that of the existing technique. The throughput of IoT devices was improved by an average of 12.5% over the existing techniques.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.2
• /
• pp.141-147
• /
• 2009

We introduce a noble method to find a variation of the optimal path problem. The problem is to find the optimal decomposition of an original planar region such that the number of paths in the region is minimized. The paths are required to uniformly cover each subregion and the directions of the paths in each sub-region are required to be either entirely vertical or entirely horizontal. We show how we can transform the path problem into a graph s-t cut problem. We solve the transformed s-t cut problem using the Ford-Fulkerson method and show its performance. The approach can be used in zig-zag milling and layerd manufacturing.

• Convergence Security Journal
• /
• v.23 no.1
• /
• pp.3-8
• /
• 2023

Multi-domain optical transport networks are not fundamentally interoperable and require an integrated orchestration mechanism and path provision mechanism at the entire network level. In addition, ensuring network survivability is one of the important issues. MPLS-TP (Multi-Protocol Label Switching-Transport Profile) defines various protection/recovery methods as standards, but does not mention how to calculate and select protection/recovery paths. Therefore, an algorithm that minimizes protection/recovery collisions at the optical circuit packet integrated network level and calculates and sets a path that can be rapidly protected/recovered over the entire integrated network area is required. In this paper, we proposed an algorithm that calculates and sets up a path that can be rapidly protected and restored in a T-SDN network composed of multiple ring-mesh topology.

• Kyungpook Mathematical Journal
• /
• v.46 no.3
• /
• pp.445-448
• /
• 2006

Let N be a normal subgroup of a path-connected topological group (G, $t$). In this paper, the authors consider the existence of path-connectedness in refined topologies in order to address the property of maximal path-connectedness in topological groups. In particular, refinements on $t$ and refinements on the quotient topology on G/N are studied. The preservation of path-connectedness in extending topologies and translation topologies is also considered.

• Journal of the Korean Mathematical Society
• /
• v.38 no.2
• /
• pp.469-483
• /
• 2001

The configuration space and phase space oscillatory path integrals are computed in the case of the stochastic Schrodinger equation for the harmonic oscillator with a stochastic term of the form (K$\psi$(sub)t)(x) o dW(sub)t, where K is either the position operator or the momentum operator, and W(sub)t is the Wiener process. In this way formulae are derived for the stochastic analogues of the Mehler kernel.

• Journal of Engineering Education Research
• /
• v.18 no.1
• /
• pp.11-19
• /
• 2015

This paper presumes the size and status of the deviation from S&T workforce career-path throughout the whole life cycle. For this purpose, we make a operational definition and analyzing framework for career departure of S&T workforce and then find out some results as followings. For example, the career departure is more serious in the utilization phase of S&T workforce than the training phase and the qualitative career departure is a still more important problem at both phase. Finally, we suggest some policy implications to solve these problems.