• Science of Emotion and Sensibility
• /
• v.13 no.4
• /
• pp.789-796
• /
• 2010

The purpose of this study was to test a large screen and rear-projected virtual reality (VR) interface in color choice for environmental design. The study piloted a single three-dimensional model of a bedroom including furniture in different color combinations. Using a mouse with an $8'{\times}6'$ rear-projector screen, participants could move 360 degree motion in each room. The study used 34 college students who viewed and interacted with virtual rooms projected on a large screen, then filled out a survey. This study aimed to understand the interaction between the users and the VR interface through measurable dimensions of the interaction: interest and user perceptions of presence and emotion. Specifically, the study focused on spatial presence, topic involvement, and enjoyment. Findings should inform design researchers how empirical evidence involving environmental effects can be obtained using a VR interface and how users experience the interaction with the interface.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.7
• /
• pp.95-103
• /
• 2011

The actual utilization of Semantic Web technology which aims to provide more intelligent and automated service for information retrieval over the Web becomes gradually reality. RDF is widely used as the one of standard formats to present and manage the voluminous data on the Web. Efficient query processing on RDF data, therefore, is one of the ongoing research topics. Retrieving resources having a specific association from a given resource is the typical query processing type and several researches for this have done. However the most of previous researches have not fully considered discovering the complex relationship among resources such as returning the association between resources as the query processing result. This paper introduces the indexing and query processing for ${\rho}$-intersect operation which is one of the semantic association retrieval types. It includes an indexing scheme using suffix array and optimal processing approaches for handling ${\rho}$-intersect operation. The experimental evaluations shows that the average execution times for the proposed approach is 3~7 times faster than the previous approach.

• Journal of Korean Philosophical Society
• /
• v.123
• /
• pp.281-307
• /
• 2012

In the modern society, we have come to recognize human emotions such as anxiety, fear, pain, anger, sadness, longing, desire and pleasure as important topics of philosophy. How shall we study the 'problem of emotions', or in a bigger sense, the 'problem of empathy'? With this critical mind, the research into empathy can be called as a starting point for studying the deepest feelings and thoughts of human beings in connection with the feelings of other people. Most of all, in order to understand other people and to understand human being itself, the role of sympathy or empathy has been emphasized among the problems of emotions, and this trend is especially distinctive in the philosophy of psychology. I definitely acknowledge that empathy or sympathy takes loneliness and agony away from a human being and therefore it is the starting point of communication between people. However, the very fundamental question of 'what are human beings, and who are they?' is once again reminded. In other words, this thesis focuses on the fact that humans are viewed not only as the existence with a soul or heart, but also as a "unique existence" containing something "material-, life- and spiritual", and in that sense, this world is an ecological organism that contains organic connections of humans, material things, plants and animals, which should be the point of view for approach. And it is also emphasized in this study to approach the question about human beings from the religious spirituality point of view that the society with true love for neighbors could be achieved through religious practices that provide principles and value.

• The KIPS Transactions:PartD
• /
• v.18D no.6
• /
• pp.501-508
• /
• 2011

A knowledge map, which has been recently applied in various fields, is discovering characteristics hidden in a large amount of information and showing a tangible output to understand the meaning of the discovery. In this paper, we suggested a knowledge map for research trend analysis based on keyword-relation networks which are constructed by using a database of the domestic journal articles in the computer engineering field from 2000 through 2010. From that knowledge map, we could infer influential changes of a research topic related a specific keyword through examining the change of sizes of the connected components to which the keyword belongs in the keyword-relation networks. In addition, we observed that the size of the largest connected component in the keyword-relation networks is relatively small and groups of high-similarity keyword pairs are clustered in them by comparison with the random networks. This implies that the research field corresponding to the largest connected component is not so huge and many small-scale topics included in it are highly clustered and loosely-connected to each other. our proposed knowledge map can be considered as a approach for the research trend analysis while it is impossible to obtain those results by conventional approaches such as analyzing the frequency of an individual keyword.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.682-683
• /
• 2019

본 논문에서는 인공지능 Watson 기반의 챗봇 시스템에서 효율적인 자연어 처리를 위한 시나리오 설계 방법을 제안하고자 한다. 주제별 시나리오 구성을 단순히 무작위 순서로 배치하는 것 보다 연관도가 높은 노드를 가깝게 연결하는 것이 주제 전환 속도와 효율성 측면에서 유의미한 것으로 나타났다. 시스템의 구성 요소를 연결해주는 어플리케이션은 빠르게 질문과 답변 전달이 가능하도록 모듈화하여 PaaS 클라우드에 연결하도록 한다. 그 결과 경제적이고 단순한 개발 환경에서 어플리케이션을 구현하는 것이 가능했다. API를 호출하여 답변을 전달하는 경우에는 약 2.005초 정도로 빠른 응답 속도를 보였다. 따라서 본 논문에서 설명하는 챗봇 시스템 설계 방법을 사용할 경우 저비용으로 효율성 있는 서비스 제공 플랫폼을 구축할 수 있다.

• Proceedings of the Korean Society of Disaster Information Conference
• /
• 2022.10a
• /
• pp.145-147
• /
• 2022

본 논문은 대규모 텍스트 데이터에서 이슈를 발굴할 때 사용되는 기존의 정보 네트워크 또는 지식 그래프 구축 방법의 한계점을 지적하고, 문장 단위로 정보 네트워크를 구축하는 새로운 방법에 대해서 제안한다. 먼저 문장을 구성하는 단어와 캐릭터수의 분포를 측정하며 의성어와 같은 노이즈를 제거하기 위한 역치값을 설정하였다. 다음으로 BERT 기반 언어모델을 이용하여 모든 문장을 벡터화하고, 코사인 유사도를 이용하여 두 문장벡터에 대한 유사성을 측정하였다. 오분류된 유사도 결과를 최소화하기 위하여 명사형 단어의 의미적 연관성을 비교하는 알고리즘을 개발하였다. 제안된 유사문장 비교 알고리즘의 결과를 검토해 보면, 두 문장은 서술되는 형태가 다르지만 동일한 주제와 내용을 다루고 있는 것을 확인할 수 있었다. 본 논문에서 제안하는 방법은 단어 단위 지식 그래프 해석의 어려움을 극복할 수 있는 새로운 방법이다. 향후 이슈 및 트랜드 분석과 같은 미래연구 분야에 적용하면, 데이터 기반으로 특정 주제에 대한 사회적 관심을 수렴하고, 수요를 반영한 정책적 제언을 도출하는데 기여할 수 있을 것이다

• Journal of the Korean Society for information Management
• /
• v.31 no.4
• /
• pp.161-178
• /
• 2014

Recently, many information services allow users to collaborate to produce and use information. Sharing information is also important for users who have similar taste or interest. As various channels are available for users to share their experiences and knowledge, users' data have also been accumulated within the information services. This study collected movie lists made by users of IMDB service. Co-word analysis and ego-centered network analysis were adapted to discover relevant information for users who chose a specific movie. Three factors of movies including movie title, director and genre were used to present related movie information. Movie title is an effective feature to present related movies with various aspects such as theme or characters and the popularity of directors affects on identifying related directors. Genre is not useful to find related movies due to the complexity in the topic of a movie.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2006.05a
• /
• pp.1465-1469
• /
• 2006

수문순환 과정은 기상현상과 밀접한 관련을 가지고 서로 연관되어 있다. 이러한 연관성을 규명하여 수자원관리에 위험도를 감소시키려는 노력은 많은 분야에서 이루어지고 있으며, 주요 연구 주제가 되고 있다. 이러한 기상현상 중에서 가뭄은 여러 가지 요소가 복합되어 발생되는 것으로 알려지고 있으나 이를 설명하기에는 여전히 부족한 면이 존재한다. 가뭄을 발생시키는 몇 가지 가능한 원인으로는 E1 Nino-Southern Oscillation(ENSO)현상으로 잘 알려져 있는 비정상적인 해수면 온도의 변화나 기후 시스템의 비선형적 거동을 들 수 있다. 특히, 기후 시스템은 대개 경년 변화(inter-annual variability) 및 10년 이상의 주기(decadal variability) 특성을 가지고 있으며 가뭄 또한 경년변화의 주기 특성을 나타내고 있는 것으로 알려지고 있다. 이러한 관점에서 수문시계열을 특정 주파수(frequency)에서 고립시킨 후, 분석이 가능한 분해방법(decomposition method)을 통해 보다 해석적으로 접근하는 것이 가능하다. 이를 위해 본 연구에서는 Wavelet Transform분석을 도입하였으며 통계적으로 유의한 성분을 시계열로부터 추출하여 가뭄과 기상인자와의 변동성 분석을 실시하였다.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.35 no.6
• /
• pp.461-470
• /
• 2017

In Korea, starting with the Government 3.0 Policy, the utilization of public data as an important driving force to promote economic growth has been highlighted as a major issue. However Korea is currently only able to open and provide accumulated data stored in the public domain. To resolve this issue, we need to not only open and provide public information, but also to create new information by linking the data and developing related services. Thus, this study analyzes the linkability of public information and provides lists of the linkable public data. In order to do this, we first have performed preconditioning processes on the accessibility and workability of the data. Next, we have deduced the major keywords in public data through analyzing the morphemes, and then the core keywords (Top 10) and their linkable keyword lists through an analysis of social networks. Based on the outcome of this study, a subsequent study will deduce new information by linking the public data and creating various services and information contents. Furthermore, not only conceptual but also practical linking measures need to be created, and a related law must be prepared.

• Annual Conference on Human and Language Technology
• /
• 2008.10a
• /
• pp.75-78
• /
• 2008

온톨로지 어노테이션(Annotation)과정은 수동에 의해 대부분의 문서 처리 작업이 진행되고 있다. 그러므로 계획적이지 않은 문서 처리는 자칫 일관성이나 효율성을 떨어뜨릴 수가 있다. 예를 들어, 처리되는 문서들의 도메인이 자주 바뀌면, 수동 어노테이션을 하는 작업자는 객관성을 잃을 가능성이 높다. 따라서, 본 연구에서는 처리되는 문서집합의 도메인이 최대한 연관성이 유지되도록 처리 문서를 집합하여 나열하는 알고리즘을 소개한다. 첫번째로, 문서들을 유사한 주제 집합으로 형성한다. 두번째로, 두개 이상의 집합에 겹치는 문서들을 계산한다. 마지막으로, 이러한 겹침이 최대화 되도록 문서들의 처리 순서를 나열한다. 본 알고리즘을 IT관련 위키피디아 문서집합을 이용하여 평가를 시행했다. 평가 결과 우리의 알고리즘을 이용하면 처리되는 문서들의 도메인 이동이 무작위로 처리하는 것 보다 연속적이었음을 수치상으로 계산할 수 있었다.