• Journal of Information Science Theory and Practice
• /
• v.11 no.3
• /
• pp.43-57
• /
• 2023

Government codes are created and utilized to streamline and standardize government administrative procedures. They are generally employed in government information systems. Because they are included in open datasets of public data, users must be able to understand them. However, information that can be used to comprehend administrative code is lost during the process of releasing data in the government system, making it difficult for data consumers to grasp the code and limiting the connection or convergence of different datasets that use the same code.This study proposes a way to employ the administrative code produced by the Korean government as a standard in a public data environment on a regular basis. Because consumers of public data are barred from accessing government systems, a means of universal access to administrative code is required. An ontology model is used to represent the administrative code's data structure and meaning, and the full administrative code is built as a knowledge graph. The knowledge graph thus created is used to assess the accuracy and connection of administrative codes in public data. The method proposed in this study has the potential to increase the quality of coded information in public data as well as data connectivity.

• Journal of Digital Convergence
• /
• v.20 no.2
• /
• pp.345-351
• /
• 2022

For simple undirected graph G=(V,E), L(2,1)-coloring of G is a nonnegative real-valued function f : V → [0,1,…,k] such that whenever vertices x and y are adjacent in G then |f(x)-f(y)|≥ 2 and whenever the distance between x and y is 2, |f(x)-f(y)|≥ 1. For a given L(2,1)-coloring c of graph G, the c-span is λ(c) = max{|c(v)-c(v)||u,v∈V}. L(2,1)-coloring number λ(G) = min{λ(c)} where the minimum is taken over all L(2,1)-coloring c of graph G. In this paper, based on Harary's Theorem, we use Tabu Search to figure out the existence of Hamiltonian Path in a complementary graph and confirmed that if λ(G) is equal to n(=|V|).

• Design Convergence Study
• /
• v.14 no.4
• /
• pp.133-150
• /
• 2015

In this study, we proposed Interactive Visualization methods that can be analyzed relations between nations in various viewpoints such as period, issue using total 5211 of the UN General Assembly voting data.For this research, we devised a similarity matrix between nations and developed two visualization method based similarity matrix. The first one is Network Graph Visualization that can be showed relations between nations which participated in the vote of the UN General Assembly like Social Network Graph by year. and the second one is Proximity based Circular Visualization that can be analyzed relations between nations focus on one nation or Changes in voting patterns between nations according to time. This study have a great signification. that's because we proposed Proximity based Circular Visualization methods which merged Line and Circle Graph for network analysis that never tried from other cases of studies that utilize conventional voting data and made it. We also derived co-operatives of each visualization through conducting a comparative experiment for the two visualization. As a research result, we found that Proximity based Circular Visualization can be better analysis each node and Network Graph Visualization can be better analysis patterns for the nations.

• Journal for History of Mathematics
• /
• v.30 no.1
• /
• pp.31-50
• /
• 2017

This study analyses on the history of uniform convergence, and discusses its educational implications. First, this study inspects 'overflowing of the Euclidean methodology' which was suggested by Lakatos as a cause of tardy appearance of uniform convergence, and reinterprets that cause in the perspective of 'symbolization'. Second, this study looks into the emergence of uniform convergence of Seidel and Weierstrass in this viewpoint of symbolization. As a result, of analysis, we come to know that the definition of uniform convergence had been changed into the theory of 'domain and graph' from that of 'point and function value' by the location change of the quantifier. As these results, this study puts forward an educational suggestion from an angle of epistemological obstacle, concept definition and concept image.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.11a
• /
• pp.374-376
• /
• 2022

Community detection is meaningful research in social network analysis, and many existing studies use graph theory analysis methods to detect communities. This paper proposes a method to detect community by detecting maximal cliques and obtain the high influence cliques by high influence nodes, then merge the cliques with high similarity in social network.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2023.01a
• /
• pp.293-296
• /
• 2023

본 논문에서는 고속도로의 교통망의 연결성을 분석하고 예측하기 위하여 그래프 이론을 이용하여 접근성 지표의 알고리즘을 제안한다. 먼저 2025년 고속도로 교통망을 그래프로 나타낸 운송네트워크를 구한다. 그리고 그래프 이론의 연결수, 비교거리, 접근지표, 연결도, 산포지수, 지름 등의 개념을 이용하여 2025년 고속도로 교통망의 연결성을 분석하고 예측하기 위하여 주어진 운송네트워크로부터 다양한 접근성 지표를 쉽게 얻을 수 있는 알고리즘을 제시한다. 이를 통하여 고속도로의 운송네트워크에서 교통의 중심이 되는 도시를 찾을 수 있다.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.571-584
• /
• 1998

We look for methods and conditions to make use of cyclicity in come matrix problems not only for parallel computa-tion but also to reduce the problem size and accelerate convergence. It has been shown that some form of reducibility not necessarily cyclicity is enough for such purposes.

• Korean Institute of Interior Design Journal
• /
• v.23 no.2
• /
• pp.166-173
• /
• 2014

This study analyzed visual-perceptual centrality as a measure to solve the confusion that might occur in visitor's movement in analyzing contemporary museums that have recently expand. Also, this study proposed a new methodology to understand the relationships of the occurrence and convergence of visual-perceptual power. The existing visibility graph analysis mostly ends up in identifying nodes corresponding to the physical environment of museums while the newly proposed visibility graph analysis is a methodology that can analyze the landmark on which the visual-perceptual power occurs and converges, by setting visible space elements as analysis variables, which showed a possibility to draw more reliable results in parallel to the existing analysis, and the results of this analysis are as follows. A public museum located in downtown has a limitation that it cannot but be multi-layered as a way to enlarge for the accommodation of a variety of programs on a limited site. Also, this study found that the problem of visitor orientation occurring in the multi-layer process was solved by a major space which was visual-perceptually void. Also, its types can be summarized into two types: One is setting parameter spaces (ramps, staircases, hallways) linked visual-perceptually to the major space and the other is solving the confusion of the visitor's movement by composing a simple exhibition space. In particular, it is judged that the type solving the confusion of the visitor's movement by composing a simple exhibition space also had a relationship with changes in the characteristics of the exhibited works by period. In addition, it was found that the entrance also appeared in two types: dependent type and independent type in the major space according to the characteristics of the major space.

• International journal of advanced smart convergence
• /
• v.9 no.3
• /
• pp.192-198
• /
• 2020

The 3D point cloud is a key technology of object detection for virtual reality and augmented reality. In order to apply various areas of object detection, it is necessary to obtain 3D information and even color information more easily. In general, to generate a 3D point cloud, it is acquired using an expensive scanner device. However, 3D and characteristic information such as RGB and depth can be easily obtained in a mobile device. GNN (Graph Neural Network) can be used for object detection based on these characteristics. In this paper, we have generated RGB and RGBD by detecting basic information and characteristic information from the KITTI dataset, which is often used in 3D point cloud object detection. We have generated RGB-GNN with i-GNN, which is the most widely used LiDAR characteristic information, and color information characteristics that can be obtained from mobile devices. We compared and analyzed object detection accuracy using RGBD-GNN, which characterizes color and depth information.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.1
• /
• pp.73-77
• /
• 2007

In this paper, we propose a VLSI architecture of an LMS filter based on a Cyclo-static scheduler for fast computation of LMS filteing algorithm which is widely used in adptive filtering area. This process is composed of two steps: scheduling and circuit synthesis. The scheduling step accepts a fully specified flow graph(FSFG) as an input, and generates an optimal Cyclo-static schedule in the sense of the sampling rate, the number of processors, and the input-output delay. Then the generated schedule is transformed so that the number of communication edges between the processors. The circuit synthesis part translates the modified schedule into a complete circuit diagram by performing resource allocations. The VLSI layout generation can be performed easily by an existing silicon compiler.