• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.621-623
• /
• 2021

Open science policies are spreading that disclose, share, and utilize research results produced through government public funds. As a policy to revitalize open science, interest in research support services that allow easy search, access, and reuse of results is increasing. To support services to provide researchers with various information, we propose a research resource knowledge graph model to meaningfully express the relationship between the scattered various outcome data. In this paper, it contributes to the improvement of the service of the national research data platform DataON by meaningfully connecting national R&D task information, researcher information, performance information, and research data information.

• International Journal of High-Rise Buildings
• /
• v.12 no.3
• /
• pp.203-208
• /
• 2023

The implementation of artificial intelligence (AI) design for tall building structures is an essential solution for addressing critical challenges in the current structural design industry. Generative AI technology is a crucial technical aid because it can acquire knowledge of design principles from multiple sources, such as architectural and structural design data, empirical knowledge, and mechanical principles. This paper presents a set of AI design techniques for building structures based on two types of generative AI: generative adversarial networks and graph neural networks. Specifically, these techniques effectively master the design of vertical and horizontal component layouts as well as the cross-sectional size of components in reinforced concrete shear walls and frame structures of tall buildings. Consequently, these approaches enable the development of high-quality and high-efficiency AI designs for building structures.

• Journal of the Korean Society for information Management
• /
• v.31 no.1
• /
• pp.231-250
• /
• 2014

Due to the recent development of Information and Communication Technologies (ICT), the amount of research publications has increased exponentially. In response to this rapid growth, the demand of automated text processing methods has risen to deal with massive amount of text data. Biomedical text mining discovering hidden biological meanings and treatments from biomedical literatures becomes a pivotal methodology and it helps medical disciplines reduce the time and cost. Many researchers have conducted literature-based discovery studies to generate new hypotheses. However, existing approaches either require intensive manual process of during the procedures or a semi-automatic procedure to find and select biomedical entities. In addition, they had limitations of showing one dimension that is, the cause-and-effect relationship between two concepts. Thus;this study proposed a novel approach to discover various relationships among source and target concepts and their intermediate concepts by expanding intermediate concepts to multi-levels. This study provided distinct perspectives for literature-based discovery by not only discovering the meaningful relationship among concepts in biomedical literature through graph-based path interference but also being able to generate feasible new hypotheses.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.55 no.9
• /
• pp.351-358
• /
• 2006

In this paper, DSPOCS(Digital Switchgear-Panel Operation and Control Solution) is designed, which is the intelligent inference based operation and control solution to obtain the safety and reliability of electric power supply in substation based on IED. DSPOCS is designed as a scheduled monitoring and control task and a real-time alarm inference task, and is interlinked with BRES(Bus Reconfiguration Expert System) in the required case. The intelligent alarm inference task consists of the alarm knowledge generation part and the real-time pattern matching part. The alarm knowledge generation part generates automatically alarm knowledge from DB saves it in alarm knowledge base. On the other hand, the pattern matching part inferences the real-time event by comparing the real-time event information furnished from IEDs of substation with the patterns of the saved alarm knowledge base.; Especially, alarm knowledge base includes the knowledge patterns related with fault alarm, the overload alarm and the diagnosis alarm. In order to design the database independently in substation structure, busbar is represented as a connectivity node which makes the more generalized graph theory possible. Finally, DSPOCS is implemented in MS Visual $C^{++}$, MFC, the effectiveness and accuracy of the design is verified by simulation study to the typical distribution substation.

• The Journal of the Korea Contents Association
• /
• v.12 no.8
• /
• pp.1-12
• /
• 2012

We develop the Spatio-Temporal Graph to imbue the historical context to the situations in a virtual world, and an ontology to enable a structural description of their elements such as the objects, relationships, and activities. In the time dimension the graph models all the temporal phases of the future besides the past and present in a comprehensive manner, and all the spatial aspects in an intuitive but efficient fashion. The overall architecture composing the Physical Layer, Logical Layer and Conceptual Layer which are integrated according to their interrelations allows events occurring in their corresponding worlds to be simulated in historical context. The S-T Graph could be used both to simulate the situations in the virtual world and to realize the knowledge systems of the virtual inhabitants to be used in judging and evaluating those situations. By adding temporal changes to the multi-layered architecture of our virtual world, this model lays a foundation for maximizing the diversity of situations in the simulation of a virtual world.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.3046-3070
• /
• 2017

Nowadays, the utilization of multiprocessor environments has been increased due to the increase in time complexity of application programs and decrease in hardware costs. In such architectures during the compilation step, each program is decomposed into the smaller and maybe dependent segments so-called tasks. Precedence constraints, required execution times of the tasks, and communication costs among them are modeled using a directed acyclic graph (DAG) named task-graph. All the tasks in the task-graph must be assigned to a predefined number of processors in such a way that the precedence constraints are preserved, and the program's completion time is minimized, and this is an NP-hard problem from the time-complexity point of view. The results obtained by different approaches are dominated by two major factors; first, which order of tasks should be selected (sequence subproblem), and second, how the selected sequence should be assigned to the processors (assigning subproblem). In this paper, a hybrid proposed approach has been presented, in which two different artificial ant colonies cooperate to solve the multiprocessor task-scheduling problem; one colony to tackle the sequence subproblem, and another to cope with assigning subproblem. The utilization of background knowledge about the problem (different priority measurements of the tasks) has made the proposed approach very robust and efficient. 125 different task-graphs with various shape parameters such as size, communication-to-computation ratio and parallelism have been utilized for a comprehensive evaluation of the proposed approach, and the results show its superiority versus the other conventional methods from the performance point of view.

• The Journal of the Korea Contents Association
• /
• v.22 no.8
• /
• pp.33-43
• /
• 2022

Labeled graphs are used to represent entities, their relationships, and their structures in real data such as knowledge graphs and protein interactions. With the rapid development of IT and the explosive increase in data, there has been a need for a subgraph matching technology to provide information that the user is interested in. In this paper, we propose an approximate Top-k labeled subgraph matching scheme that considers the semantic similarity of labels and the difference in graph structure. The proposed scheme utilizes a learning model using FastText in order to consider the semantic similarity of a label. In addition, the label similarity graph(LSG) is used for approximate subgraph matching by calculating similarity values between labels in advance. Through the LSG, we can resolve the limitations of the existing schemes that subgraph expansion is possible only if the labels match exactly. It supports structural similarity for a query graph by performing searches up to 2-hop. Based on the similarity value, we provide k subgraph matching results. We conduct various performance evaluations in order to show the superiority of the proposed scheme.

• Journal of Internet Computing and Services
• /
• v.21 no.3
• /
• pp.123-131
• /
• 2020

Along with the rapid development of artificial intelligence technology, natural language processing, which deals with human language, is also actively studied. In particular, BERT, a language model recently proposed by Google, has been performing well in many areas of natural language processing by providing pre-trained model using a large number of corpus. Although BERT supports multilingual model, we should use the pre-trained model using large amounts of Korean corpus because there are limitations when we apply the original pre-trained BERT model directly to Korean. Also, text contains not only vocabulary, grammar, but contextual meanings such as the relation between the front and the rear, and situation. In the existing natural language processing field, research has been conducted mainly on vocabulary or grammatical meaning. Accurate identification of contextual information embedded in text plays an important role in understanding context. Knowledge graphs, which are linked using the relationship of words, have the advantage of being able to learn context easily from computer. In this paper, we propose a system to extract Korean contextual information using pre-trained BERT model with Korean language corpus and knowledge graph. We build models that can extract person, relationship, emotion, space, and time information that is important in the text and validate the proposed system through experiments.

• Journal of Digital Convergence
• /
• v.12 no.6
• /
• pp.245-252
• /
• 2014

Semantic search promises to provide more accurate result than present-day keyword matching-based search by using the knowledge base represented logically. But, the ordinary users don't know well the complex formal query language and schema of the knowledge base. So, the system should interpret the meaning of user's keywords. In this paper, we describe a user query interpretation system for the semantic retrieval of multimedia contents. Our system is ontological knowledge base-driven in the sense that the interpretation process is integrated into a unified structure around a knowledge base, which is built on domain ontologies.

• ETRI Journal
• /
• v.39 no.4
• /
• pp.592-604
• /
• 2017

Intrusion detection is very important for network situation awareness. While a few methods have been proposed to detect network intrusion, they cannot directly and effectively utilize semi-quantitative information consisting of expert knowledge and quantitative data. Hence, this paper proposes a new detection model based on a directed acyclic graph (DAG) and a belief rule base (BRB). In the proposed model, called DAG-BRB, the DAG is employed to construct a multi-layered BRB model that can avoid explosion of combinations of rule number because of a large number of types of intrusion. To obtain the optimal parameters of the DAG-BRB model, an improved constraint covariance matrix adaption evolution strategy (CMA-ES) is developed that can effectively solve the constraint problem in the BRB. A case study was used to test the efficiency of the proposed DAG-BRB. The results showed that compared with other detection models, the DAG-BRB model has a higher detection rate and can be used in real networks.