• Journal of KIISE:Software and Applications
• /
• v.36 no.6
• /
• pp.479-490
• /
• 2009

A number of temporal abstraction approaches have been suggested so far to handle the high computational complexity of Markov decision problems (MDPs). Although the structure of temporal abstraction can significantly affect the efficiency of solving the MDP, to our knowledge none of current temporal abstraction approaches explicitly consider the relationship between topology and efficiency. In this paper, we first show that a topological measurement from complex network literature, mean geodesic distance, can reflect the efficiency of solving MDP. Based on this, we build an incremental method to systematically build temporal abstractions using a network model that guarantees a small mean geodesic distance. We test our algorithm on a realistic 3D game environment, and experimental results show that our model has subpolynomial growth of mean geodesic distance according to problem size, which enables efficient solving of resulting MDP.

• Journal of Intelligence and Information Systems
• /
• v.13 no.3
• /
• pp.101-117
• /
• 2007

In this paper, we propose a customized genetic algorithm (GA) to find the minimum-cost guideway network (GN) of personal rapid transit (PRT) subject to connectivity, reliability, and traffic capacity constraints. PRT is a novel transportation concept, where a number of automated taxi-sized vehicles run on an elevated GN. One of the most important problems regarding PRT is how to design its GN topology for given station locations and the associated inter-station traffic demands. We model the GN as a directed graph, where its cost, connectivity, reliability, and node traffics are formulated. Based on this formulation, we develop the GA with special genetic operators well suited for the GN design problem. Such operators include steady state selection, repair algorithm, and directed mutation. We perform numerical experiments to determine the adequate GA parameters and compare its performance to other optimization algorithms previously reported. The experimental results verify the effectiveness and efficiency of the proposed approach for the GN design problem having up to 210 links.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.83-86
• /
• 1996

In this paper we study the problem of augmenting a physical network to improve the topology for new survivable network architectures. We are given a graph G=(V,E,F), where V is a set of nodes that represents transmission systems which be interconnected by physical links, and E is a collection of edges that represent the possible pairs of nodes between which a direct transmission link can be placed. F, a subset of E is defined as a set of the existing direct links, and E/F is defined as a set of edges for the possible new connection. The cost of establishing network $N_{H}$=(V,H,F) is defined by the sum of the costs of the individual links contained in new link set H. We call that $N_{H}$=(V,H,F) is feasible if certain connectivity constrints can be satisfied in $N_{H}$=(V,H,F). The computational goal for the suggested model is to find a minimum cost network among the feasible solutions. For a k edge (node) connected component S .subeq. F, we charactrize some optimality conditions with respect to S. By this characterization we can find part of the network that formed by only F-edges. We do not need to augment E/F edges for these components in an optimal solution. Hence we shrink the related component into a node. We study some good primal heuristics by considering construction and exchange ideas. For the construction heuristics, we use some greedy methods and relaxation methods. For the improvement heuristics we generalize known exchange heuristics such as two-optimal cycle, three-optimal cycle, pretzel, quezel and one-optimal heuristics. Some computational experiments show that our heuristic is more efficient than some well known heuristics.stics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.4
• /
• pp.2002-2019
• /
• 2017

RPL routing protocol for low-power and lossy networks is an Internet Engineering Task Force (IETF) recommended IPv6 based protocol for routing over Low power Lossy Networks (LLNs). RPL is proposed for networks with characteristics like small packet size, low bandwidth, low data rate, lossy wireless links and low power. RPL is a proactive routing protocol that creates a Directed Acyclic Graph (DAG) of the network topology. RPL is increasingly used for Internet of Things (IoT) which comprises of heterogeneous networks and applications. RPL proposes a single path routing strategy. The forwarding technique of RPL does not support multiple paths between source and destination. Multipath routing is an important strategy used in both sensor and ad-hoc network for performance enhancement. Multipath routing is also used to achieve multi-fold objectives including higher reliability, increase in throughput, fault tolerance, congestion mitigation and hole avoidance. In this paper, M-RPL (Multi-path extension of RPL) is proposed, which aims to provide temporary multiple paths during congestion over a single routing path. Congestion is primarily detected using buffer size and packet delivery ratio at forwarding nodes. Congestion is mitigated by creating partially disjoint multiple paths and by avoiding forwarding of packets through the congested node. Detailed simulation analysis of M-RPL against RPL in both grid and random topologies shows that M-RPL successfully mitigates congestion and it enhances overall network throughput.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.2
• /
• pp.257-263
• /
• 2002

A graph embedding problem has been studied for applications of resource allocation and mapping the underlying data structure of a parallel algorithm into the interconnection architecture of massively parallel processing systems. In this paper, we consider the embedding problem of the pyramid into the regular 2-dimensional mesh interconnection network topology. We propose a new embedding function which can embed the pyramid of height N into 2$^{N}$ x2$^{N}$ 2-dimensional mesh with dilation max{2$^{N1}$-2. [3.2$^{N4}$＋1)/2, 2$^{N3}$＋2. [3.2$^{N4}$＋1)/2]}. This means an improvement in the dilation measure from 2$^{N}$ $^1$in the previous result into about (5/8) . 2$^{N1}$ under the same condition.condition.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2004.11a
• /
• pp.265-271
• /
• 2004

The interaction network of protein -protein plays an important role to understand the various biological functions of cells. Currently, the high -throughput experimental techniques (two -dimensional gel electrophoresis, mass spectroscopy, yeast two -hybrid assay) provide us with the vast amount of data for protein-protein interaction at the proteome scale. In order to recognize the role of each protein in their network, the efficient bioinformatical and computational analysis methods are required. We propose a systematic and mathematical method which can analyze the protein -protein interaction network rigorously and enable us to capture the biological and physical essence of a topological character and stability of protein -protein network, and sensitivity of each protein along the biological pathway of their network. We set up a Laplacian matrix of spectral graph theory based on the protein-protein network of yeast proteome, and perform an eigenvalue analysis and apply a perturbation method on a Laplacian matrix, which result in recognizing the center of protein cluster, the identity of hub proteins around it and their relative sensitivities. Identifying the topology of protein -protein network via a Laplacian matrix, we can recognize the important relation between the biological pathway of yeast proteome and the formalism of master equation. The results of our systematic and mathematical analysis agree well with the experimental findings of yeast proteome. The biological function and meaning of each protein cluster can be explained easily. Our rigorous analysis method is robust for understanding various kinds of networks whether they are biological, social, economical...etc

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.291-299
• /
• 2016

This paper raises a question of whether a simple periodic phenomenon is associated with the topology and provides the convincing answers to it. A variety of music instrumental sound signals are used to prove our assertion, which are embedded in Euclidean space to analyze their topologies by computing the homology groups. A commute time embedding is employed to transform segments of waveforms into the corresponding geometries, which is implemented by organizing patches according to the graph-based metric. It is shown that commute time embedding generates the intrinsic topological complexities although their geometries are varied according to the spectrums of the signals. This paper employs a persistent homology to determine the topological invariants of the simplicial complexes constructed by randomly sampling the commute time embedding of the waveforms, and discusses their applications.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.6
• /
• pp.785-791
• /
• 2021

In this paper, we propose a methodology for estimating the optimal traversable destination from the location-based information of the object recognized by the mobile robot to perform the object delivery service. The location estimation process is to apply the generalized Voronoi graph to the grid map to create an initial topology map composed of nodes and links, recognize objects and extract location data using RGB-D sensors, and collect the shape and distance information of obstacles. Then, by applying the hybrid approach that combines the center of gravity and thinning method, the optimal moving position for the service robot to perform the task of grabbing is estimated. And then, the optimal node information for the robot's work destination is updated by comparing the geometric distance between the estimated position and the existing node according to the node update rule.