• Title/Summary/Keyword: 온라인 공간

Search Result 612, Processing Time 0.03 seconds

Analysis of the Relations between Social Issues and Prices Using Text Mining - Avian Influenza and Egg Prices - (뉴스기사 분석을 통한 사회이슈와 가격에 관한 연구 - 조류인플루엔자와 달걀가격 중심으로 -)

  • Han, Mu Moung Cho;Kim, Yangsok;Lee, Choong Kwon
    • Smart Media Journal
    • /
    • v.7 no.1
    • /
    • pp.45-51
    • /
    • 2018
  • Avian influenza (AI) is notorious for its rapid infection rate, and has a serious impact on consumers and producers alike, especially in poultry farms. The AI outbreak, which occurred nationwide at the end of 2016, devastated the livestock farming industries. As a result, the prices of eggs and egg products had skyrocketed, and the event was reported by the media with heavy emphasis. The purpose of this study was to investigate the correlation between the egg price fluctuation and the keyword changes in online news articles reflecting social issues. To this end, we analyzed 682 cases of AI-related online news articles for fourteen weeks from November 2016 in South Korea. The results of this study are expected to contribute to understanding the relationship between the actual price of eggs and the keywords from news articles related to social issues.

The Conference Management System Architecture for Ontological Knowledge (지식의 온톨로지화를 위한 관리 시스템 아키텍처)

  • Hong, Hyun-Woo;Koh, Gwang-san;Kim, Chang-Soo;Jeong, Jae-Gil;Jung, Hoe-kyung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.1115-1118
    • /
    • 2005
  • With the development of the internet technology, The on-line conference system have been producted. Now, the on-line conference system is developing for using pattern recognition system and voice recognition system. Comparing with the off-line conference, the on-line conference is excellent in free from distance limitation. But, the on-line meetings have unavoidable weak points. it is the same as the off-line conference that when the conference goes on, the content orthopedic and the content consistency is weak. So the conference members can not seize the conference flow. Therefore, in this paper, we introduce the ontology concept. Design a new architecture using ontology mining technique for making the conference content and conference knowledge ontological. Then in order to inspection the new architecture, We design and implementation the new conference management system based knowledge.

  • PDF

Exploring the educational applicability of Metaverse-based platforms (메타버스(Metaverse) 기반 플랫폼의 교육적 활용 가능성 탐색)

  • Jeon, Jaecheon;Jung, Soon Ki
    • 한국정보교육학회:학술대회논문집
    • /
    • 2021.08a
    • /
    • pp.361-368
    • /
    • 2021
  • Daily life such as society, economy, and culture is fundamentally changing due to COVID-19, and digital transformation based on information technology (IT) such as artificial intelligence, data, and cloud is accelerating. In this study, we focused on the metaverse, which is based on the interaction between the virtual world and the real world, and explored the possibility of using the metaverse-based platform for education. The metaverse-based platform was approached from the perspective of the online education ecosystem, which means that not only online teaching and learning activities but also holistic educational activities such as learning, communication, and empathy are performed within the metaverse. In this metaverse platform, learners can feel the presence of learning, and learning motivation and immersion can be promoted. In addition, it is possible to experience self-directed learning based on the autonomy of spatial movement. Although there are technical and ethical limitations to applying the metaverse platform, it would be preferable to focus more on the interaction between learners in the metaverse world rather than high expectations.

  • PDF

An SVM-based Face Verification System Using Multiple Feature Combination and Similarity Space (다중 특징 결합과 유사도 공간을 이용한 SVM 기반 얼굴 검증 시스템)

  • 김도형;윤호섭;이재연
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.6
    • /
    • pp.808-816
    • /
    • 2004
  • This paper proposes the method of implementation of practical online face verification system based on multiple feature combination and a similarity space. The main issue in face verification is to deal with the variability in appearance. It seems difficult to solve this issue by using a single feature. Therefore, combination of mutually complementary features is necessary to cope with various changes in appearance. From this point of view, we describe the feature extraction approaches based on multiple principal component analysis and edge distribution. These features are projected on a new intra-person/extra-person similarity space that consists of several simple similarity measures, and are finally evaluated by a support vector machine. From the experiments on a realistic and large database, an equal error rate of 0.029 is achieved, which is a sufficiently practical level for many real- world applications.

A Study on Effective Revenue Model for Virtual World - Focusing on Payment Method of In-Game Assets in Social Virtual World (가상 세계를 위한 효과적인 수익 모델 연구 - 생활형 가상 세계에서 게임 내 자산 판매 방식을 중심으로 -)

  • Kim, Ha-Jung;Oh, Gyu-Hwan
    • Journal of Korea Game Society
    • /
    • v.8 no.4
    • /
    • pp.29-43
    • /
    • 2008
  • The virtual world is a cyber gaming space where a player interacts with others through their avatars. It is now mainly developed in foreign countries including USA, Canada, and Europe and many experts say that the market capacity of virtual world will be continually expanded in worldwide. The virtual world will mostly be made such that a user accesses the world for free and pays for in-game activities. But it is hardly that we find the effective methodology of payment system for such virtual world due to its' short development history. In the case of Korea, various payment methods of selling in-game assets have been tested in online games. The paper propose an effective revenue model for social virtual world focused on selling in-game assets. The guideline of the proposed revenue model will be expected to contribute creating revenue focused on selling in-game assets, effectively for social virtual world.

  • PDF

오스트리아 BAWAG은행 사례

  • Korea Database Promotion Center
    • Digital Contents
    • /
    • no.11 s.54
    • /
    • pp.19-21
    • /
    • 1997
  • 한스 군터 슈반츠니흐는 몇가지 문제들에 봉착해 있다. 그가 봉착한 문제는 어떻게 비즈니스 온라인을 성공적으로 운영할 것인가 하는 점이다. 오스트리아의 BAWAG(Bank f r Arbeit und Wirtschaft AG)의 전자데이터 처리의 관리자로서 그는 가상공간에서의 체제를 선도해야 할 책임이 있다. 그의 목적은 기존의 고객을 그대로 유지하면서 새로운 고객들을 유치해 내는 일이다.

  • PDF

건축가들에 의한 웹용 검색엔진(건축학온라인) 발견

  • MeRi, Ko-Re
    • Digital Contents
    • /
    • no.5 s.84
    • /
    • pp.90-94
    • /
    • 2000
  • 검색엔진은 사이버 공간을 유영할 때 이정표 역할을 한다. 향후 검색엔진은 불필요한 검색어를 삭제하고 단시간에 목적지에 안내하는 방향으로 발전을 할 것임에는 틀림없다. 불필요한 검색어를 걸러내고 목적지에 최단 시간에 그리고 정확하게 도달하게 하는 검색엔진. 필요한 정보 데이터에 인도하는 다양한 나침반들이 등장하고 있다.

  • PDF

A Visual Programming Technique ofr Events in VRML (VRML의 이벤트를 위한 시각 프로그래밍 기법)

  • 김수정;황충환;김수겸;김지인
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10b
    • /
    • pp.239-241
    • /
    • 1999
  • 본 연구에서는 인터넷상에서 현실감 있는 가상공간을 저작하는데 필요한 표준언어인 VRML(Virtual Reality Modeling Language)을 사용하여 손쉽고, 에러가 없이 정확하게 가상공간을 구축하기 위하여 시각프로그래밍 기법을 개발하였다. VRML로 정의된 가상공간 속의 물체를 아이콘으로 정의하고 정의된 물체들간의 상호작용을 정의해주는 이벤트(Event)들의 흐름과 그에 따른 물체의 행동을 시각적으로 표현하는 새로운 VRML 프로그래밍 기법을 제안한다. 본 연구에서 제안된 방법을 사용하면 VRML에서의 이벤트 흐름을 정의하는데 있어 직관적인 그래프 형태로 나타낼 수 있어서 VRML 코드 작성과 이해가 용이해지고, 온라인으로 VRMl 코드의 형식을 점검해주므로 에러 없는 VRML 코드를 작성하기가 쉬워진다. 그러므로 VRML 프로그래머의 생산성이 증가하고 제작된 인터넷 가상공간의 정확도와 신뢰도가 향상될 것으로 기대된다.

  • PDF

Development of GIS-based Advertizing Postal System Using Temporal and Spatial Mining Techniques (시간 및 공간마이닝 기술을 이용한 GIS기반의 홍보우편 시스템 개발)

  • Lee, Heon-Gyu;Na, Dong-Gil;Choi, Yong-Hoon;Jung, Hoon;Park, Jong-Heung
    • Spatial Information Research
    • /
    • v.19 no.2
    • /
    • pp.65-70
    • /
    • 2011
  • Advertizing postal system combined with GIS and temporal/spatial mining techniques has been developed to activate advertizing service and conduct marketing campaign efficiently. In order to select customers accurately, this system provide purchase propensity information using sequential, cyclicpatterns and lifesytle information through RFM analysis and clustering technique. It is possible for corporate mailer to do customer oriented marketing campaign with the advertizing postal system as well as 'one-stop' service including target customer selection, mail production, and delivery request.

An Algorithm for Computing Range-Groupby Queries (영역-그룹화 질의 계산 알고리즘)

  • Lee, Yeong-Gu;Mun, Yang-Se;Hwang, Gyu-Yeong
    • Journal of KIISE:Databases
    • /
    • v.29 no.4
    • /
    • pp.247-261
    • /
    • 2002
  • Aggregation is an important operation that affects the performance of OLAP systems. In this paper we define a new class of aggregation queries, called range-groupby queries, and present a method for processing them. A range-groupby query is defined as a query that, for an arbitrarily specified region of an n-dimensional cube, computes aggregations for each combination of values of the grouping attributes. Range-groupby queries are used very frequently in analyzing information in MOLAP since they allow us to summarize various trends in an arbitrarily specified subregion of the domain space. In MOLAP applications, in order to improve the performance of query processing, a method of maintaining precomputed aggregation results, called the prefix-sum array, is widely used. For the case of range-groupby queries, however, maintaining precomputed aggregation results for each combination of the grouping attributes incurs enormous storage overhead. Here, we propose a fast algorithm that can compute range-groupby queries with minimal storage overhead. Our algorithm maintains only one prefix-sum away and still effectively processes range-groupby queries for all possible combinations of the grouping attributes. Compared with the method that maintains a prefix-sum array for each combination of the grouping attributes in an n-dimensional cube, our algorithm reduces the space overhead by (equation omitted), while accessing a similar number of cells.