• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04b
• /
• pp.22-24
• /
• 2001

A new GIS software Spatial Database Engine(SDE) has been developed to integrated with spatial database that combines conventional and spatially related data. As we known well in the traditional relation database system, the query evaluation techniques are a well-researched subject, many useful and efficient algorithms have been proposed, but in the spatial database system, it is a litter difference with the traditionally ones. Based on the Query Graph Model(QGM), we implemented our own query evaulation plan in the SDE, which can deal with the full functionality query statement SELECT-FROM-WHERE_GROUPBY-HAVING, and treat the spatial data and non-spatial data seamlessly. We proposed a novel multi way join algorithm base on nest loop that may be attractive.

• Advances in Traditional Medicine
• /
• v.4 no.2
• /
• pp.120-123
• /
• 2004

To test preschool children's medium- long distance stereoscopic vision normal average value, and intermittent strabismus children,s medium-long distance stereoscopic vision acuteness is the goal of this study. The software of random stereoscopic vision and graph, which is developed by Hu-Chong etc has been used, to test 414 cases normal preschool children and 19 cases intermittent exotropia childrens medium-long distance (1-5 m) stereoscopic vision (before operation and after operation). The normal average value of preschool children's medium-long distance stereoscopic vision was achieved. Intermittent exotropia children's stereoscopic vision acuteness was declined with the increase of distance. This method can provide reference as screening abnormal stereoscopic vision during scientific research and clinical work.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.2 no.1
• /
• pp.63-72
• /
• 1999

This study proposes an easy method to develope user interfaces for the GIS using OLE automation. In the developing stage of user interface, the most important thing is to make the best use of effective windows programming techniques and component software supporting techniques. Using the OLE automation and Visual Basic programming, the study constructs an user interface as case study which performs map overlaying, referencing attribute tables, graph analysis, drawing up of thematic map.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.501-503
• /
• 2015

Malicious(악의적인) + Code 즉, 악의적인코드를 포함한 소프트웨어라는 의미로 줄여 Malware(Malicious + Software) 라고 불리는 악성코드는 최근 네트워크와 컴퓨터의 급속한 발전에 따라 기하급수적으로 증가하고 있는 추세이다. 폭발적인 증가율 추세를 보이고 있는 악성코드의 위협을 대비하기 위해 악성코드에 대한 분석이 필요한데 그 분석의 종류로는 초기분석, 동적 분석, 정적분석으로 나누고 장, 단점을 정리하였다. 또한 악성코드 대량화에 따른 효율적인 분석과 빠른 의사결정을 위한 악성코드 유사도에 대한 연구를 소개하고 API Call Sequence와 분류된 API를 이용한 악성행위 유사도 판별법을 제시하고 실험하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.607-610
• /
• 2015

소프트웨어 테스팅의 표준인 위험 기반 테스팅은 품질에 영향을 미칠 것으로 예상되는 위험들을 식별하고 분석한 결과를 바탕으로 효과적인 테스트 전략을 세우는 방법이다. 성공적인 위험 기반 테스팅을 위해서는 위험을 조기에 식별하는 것이 중요하다. 위험 식별은 하나의 프로그램 혹은 프로젝트에 따라 이해관계자의 리뷰를 통해 주관적으로 추출하는 방법을 주로 사용한다. 그러나 이는 짧은 개발주기 안에서 변화되는 위험을 즉시적으로 식별하기 어렵다. 본 논문에서는 위험 기반 호출 그래프를 이용하여 위험을 초기에 식별할 수 있는 방법을 제안한다.

• Perspectives in Nursing Science
• /
• v.16 no.1
• /
• pp.12-24
• /
• 2019

Purpose: This study examined the suitability of using text network analysis (TNA) methodology for topic analysis of academic papers related to nursing. Methods: TNA background theories, software programs, and research processes have been described in this paper. Additionally, the research methodology that applied TNA to the topic analysis of the academic nursing papers was analyzed. Results: As background theories for the study, we explained information theory, word co-occurrence analysis, graph theory, network theory, and social network analysis. The TNA procedure was described as follows: 1) collection of academic articles, 2) text extraction, 3) preprocessing, 4) generation of word co-occurrence matrices, 5) social network analysis, and 6) interpretation and discussion. Conclusion: TNA using author-keywords has several advantages. It can utilize recognized terms such as MeSH headings or terms chosen by professionals, and it saves time and effort. Additionally, the study emphasizes the necessity of developing a sophisticated research design that explores nursing research trends in a multidimensional method by applying TNA methodology.

• Journal of Internet Computing and Services
• /
• v.20 no.1
• /
• pp.125-133
• /
• 2019

Company A should maintain myriad conversion tools for the purpose of making a geometric compilation of navigation maps. Company A is already using complex compilation tools, which are tailored to geographical areas and various GPS models. However, due to frequent requirement and personnel changes, there is an endless challenge for perfect tool configuration and multiple map consolidation. To solve this problem, Company A launched a process automation project using Graphviz, which is an open source workflow graph visualization software. Before implementation, they had to document their current map compilation processes and then match it with the applicable conversion tool. For effective representation of process controls, a new graphical process notation is designed, i.e. Y Block diagram. The authors will compare Y Block diagram with other process notations and explain why Y Block diagram is more useful for tool based business processes such as digital map generation processes.

• Journal of Korea Entertainment Industry Association
• /
• v.14 no.4
• /
• pp.349-354
• /
• 2020

This paper, firstly, propose a new Clustering scheme Based on Conceptual graphs (CBC) that can describe objects freely and can perform clustering efficiently. The conceptual clustering is one of machine learning technique. The similarity among the objects in conceptual clustering are decided on the bases of concept membership, unlike the general clustering scheme which decide the similarity without considering the context or environment of the objects. A new conceptual clustering scheme, CBC, which can perform efficient conceptual clustering by describing various objects freely with conceptual graphs is introduced in this paper.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1642-1643
• /
• 2010

멀티미디어 도메인의 응용 프로그램에는 풍부한 병렬성이 내재하기 때문에 VLIW (Very Long Instruction Word) 형식의 신호처리 프로세서가 많이 사용되고 있다. VLIW 프로세서를 구성하는 복수의 연산처리유닛 (processing unit, PU)의 사용률은 컴파일러의 명령어 스케쥴러의 성능에 의하여 결정된다. 명령어들 사이의 병렬성을 분석하여 동시 수행가능한 명령어들을 각기 다른 PU 에서 수행되도록 프로그램 코드를 최적화한다. 하지만 기존의 명령어 스케쥴러는 복잡한 데이터 디펜던스 그래프 (data dependence graph, DDG)를 구성하여 복수의 PU 를 충분히 사용하도록 하지 못하는 문제점을 내재하고 있다. 이는 명령어 스케쥴러가 각 레지스터 사용시간을 별도로 고려하지 않기 때문에 실제로 내재된 데이터 디펜던스 보다 복잡성이 높은 디펜던스 그래프를 구성하게 되어 스케쥴러가 올바르게 최적화된 코드 스케쥴링 결과를 제공하지 못하기 때문이다. 본 연구에서는 레지스터의 라이프타임을 다른 레지스터를 이용하여 적절히 끊어주는 것으로 데이터 디펜던스 복잡도 완화하여 시스템 성능 향상의 가능성을 보이고 있다.

• International journal of advanced smart convergence
• /
• v.12 no.3
• /
• pp.75-88
• /
• 2023

In a specific domain, experts have different understanding of domain knowledge or different purpose of constructing ontology. These will lead to multiple different ontologies in the domain. This phenomenon is called the ontology heterogeneity. For research fields that require cross-ontology operations such as knowledge fusion and knowledge reasoning, the ontology heterogeneity has caused certain difficulties for research. In this paper, we propose a novel ontology matching model that combines word embedding and a concatenated continuous bag-of-words model. Our goal is to improve word vectors and distinguish the semantic similarity and descriptive associations. Moreover, we make the most of textual and structural information from the ontology and external resources. We represent the ontology as a graph and use the SimRank algorithm to calculate the structural similarity. Our approach employs a similarity queue to achieve one-to-many matching results which provide a wider range of insights for subsequent mining and analysis. This enhances and refines the methodology used in ontology matching.