• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.703-722
• /
• 2016

Passive wireless devices have increasing civilian and military applications, especially in the scenario with wearable devices and Internet of Things. In this paper, we study indoor localization of a target equipped with radio-frequency identification (RFID) device in ultra-wideband (UWB) wireless networks. With known room layout, deterministic multipath components, including the line-of-sight (LOS) signal and the reflected signals via multipath propagation, are employed to locate the target with one transmitter and a single inaccurate receiver. A factor graph corresponding to the joint posterior position distribution of target and receiver is constructed. However, due to the mixed distribution in the factor node of likelihood function, the expressions of messages are intractable by directly applying belief propagation on factor graph. To this end, we approximate the messages by Gaussian distribution via minimizing the Kullback-Leibler divergence (KLD) between them. Accordingly, a parametric message passing algorithm for indoor passive localization is derived, in which only the means and variances of Gaussian distributions have to be updated. Performance of the proposed algorithm and the impact of critical parameters are evaluated by Monte Carlo simulations, which demonstrate the superior performance in localization accuracy and the robustness to the statistics of multipath channels.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.1
• /
• pp.48-52
• /
• 2010

In this paper, we introduce a new path planning algorithm which combines the merits of a visibility graph algorithm and an adaptive cell decomposition. We quantize a given map with empty cells, blocked cells, and mixed cells, then find the optimal path on the quantized map using a visibility graph algorithm. For reducing the number of the quantized cells we use the quad-tree technique which is used in an adaptive cell decomposition, and for improving the performance of the visibility checking in making a visibility graph we propose a new visibility checking method which uses the property of the quad-tree instead of the well-known rotational sweep-line algorithm. For the more efficient visibility checking, we propose two additional improvements for our suggested method. Both of them are used for reducing the visited cells in the quad-tree. The experiments for a performance comparison of our algorithm with other well-known algorithms show that our proposed method is superior to others.

• School Mathematics
• /
• v.11 no.1
• /
• pp.131-145
• /
• 2009

This research was designed to investigate the possibility to teach function concept and graph representation of functions in explicit manner toward at elementary level. Eight class-hours instruction was given to four Grade 5(age 11) students, and dynamic geometry software GSP was partially used in the class. Results indicate that the students could conceptualize the function relation, interpret linear function graphs, recognize the meaning of their slopes, and discuss the relationships among linear graphs and real life situation. Results also indicate that GSP helped students to recognize the relation between dots and the linear graph clearly and that GSP-line graph did decisive role for children to understand the meaning of graph representation of function.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.415-420
• /
• 2016

A graph G=(V,E) is called an interval graph with a set V of vertices representing intervals on a line such that there is an edge $(i,j){\in}E$ if and only if intervals i and j intersect. In this paper, we are concerned in the vertex connectivity, one of various characteristics of the graph. Specifically, the vertex connectivity of an interval graph is represented by the overlapping of intervals. Also we propose an efficient algorithm to compute the vertex connectivity on the fully dynamic environment in which the vertices or the edges are inserted or deleted. Using a special kind of interval tree, we show how to compute the vertex connectivity and to maintain the tree in O(logn) time when a new interval is added or an existing interval is deleted.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.11
• /
• pp.1538-1543
• /
• 2018

For n pairs of points (a,b) on a circle, the line segment to connect two points is called a chord. These chords define a new graph G. Each chord corresponds to a vertex of G, and if two chords intersect, the two vertices corresponding to them are connected by an edge. This makes a graph, called by a circle graph. In this paper, we deal with the problem to find the connected components of a circle graph. The connected component of a graph G is a maximal subgraph H such that any two vertices in H can be connected by a path. When the adjacent matrix of G is given, the problem to find them can be solved by either the depth-first search or the breadth-first search. But when only the information for the chords is given as an input, it takes ${\Omega}(n^2)$ time to obtain the adjacent matrix. In this paper, we do not make the adjacent matrix and develop an $O(n{\log}^2n)$ algorithm for the problem.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.1
• /
• pp.97-117
• /
• 1993

This paper considers inspection station location problem for a flexible assembly line that consists of multiple stages. By considering the trade-off between locating an station at an "early" stage and at a "late" stage, we have developed some dominance relations on a graph. Based on the dominance relations, we then present an algorithm that finds an optimal inspection plan and a heuristic approach that finds a near-optimal inspection plan. The effectiveness of these two algorithms is demonstrated by two numerical examples. numerical examples.

• Computers and Concrete
• /
• v.12 no.4
• /
• pp.431-442
• /
• 2013

This study attempted to find a proper method applicable to simulating practical equifield lines of two-dimensional Accelerate Lithium Migration Technique (ALMT), and evaluate the feasibility of using the theoretical ion migration model of one-dimensional ALMT to predict the ion migration behavior of two-dimensional ALMT. The result showed that the electrolyte or carbon plate can be used as matrix to draw equifield line graph similar to that by using mortar as matrix. Using electrolyte electrode module for simulation has advantages of simple production, easy measurement, rapidness, and economy. The electrolyte module can be used to simulate the equifield line distribution diagram in practical two-dimensional electrode configuration firstly. Then, several equifield line zones were marked, and several subzones under one-dimensional ALMT were separated from various equifield line zones. The theoretical free content distribution of alkali in concrete under two-dimensional electric field effect could be obtained from duration analysis.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9A
• /
• pp.1434-1441
• /
• 1999

This paper presents an equivalent circuit of the hairpin line filter for accurate analysis and design. Its validity was verified by computer simulations and filter design experiments. Though the various design equations for a hairpin line filter have been proposed, there has not been a practically simplified equivalent circuit because it is hard to effectively represent interconnection effects between non-adjacent elements. In this paper, all the open ports of the hairpin line filter circuit are changed to the short ports using circuit duality, and the resulting circuits are transformed to graph model. The further simplified circuit model is obtained from boundary conditions, and then the final equivalent circuit of the hairpin line filter is derived in a dual structure of the filter.

• Journal of the Korean School Mathematics Society
• /
• v.23 no.3
• /
• pp.259-276
• /
• 2020

The purpose of this study was to identify how didactic transposition (teaching and learning methods) has occurred and developed in the teaching of graphs in elementary school mathematics textbooks for third and fourth graders according to the previous and current curricula. In this study, we analyzed the lesson units on bar graphs and line graphs in mathematics textbooks for each curriculum, from the fifth curriculum to the 2015 revised curriculum. We also investigated the implication of statistics education deriving from didactic transposition (teaching and learning methods). We found that the timing of teaching bar and line graphs was rarely changed as the curriculum has changed. In addition, the use of technology was not actively implemented in school statistics, although the curriculum emphasized the use of technology in statistical education. Lastly, the textbooks did not address the variability and distribution of data and the sample or sampling process, which are significant statistical concepts. Based on the findings of this study, we suggest how to teach statistical graphs and what to consider for the next mathematics textbook.

• Journal of Educational Research in Mathematics
• /
• v.16 no.1
• /
• pp.59-78
• /
• 2006

As a theoretical background for this research, the literatures which focus on the rationale of teaching and learning of connecting with mathematics and science in calculus were investigated. And teaching and learning material of connecting with mathematics and science in calculus was developed. And then, based on the case study using this material, the research questions were analyzed in depth. Students could understand mean-velocity, instant-velocity, and acceleration in the experimenting process of constant acceleration movement. Also Students could understand fundamental ideas that instant-velocity means slope of the tangent line at one point on the time-displacement graph and rate of distance change means rate of area change under a time-velocity graph.