• Title/Summary/Keyword: Sangwon

Search Result 433, Processing Time 0.028 seconds

Design of Fraudulent Process Notification for Management Information Systems (정보시스템 부정행위 신고시스템 설계)

  • Lee, Joong Hee;Lee, Sangwon;Ahn, Hyunsup
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.629-631
    • /
    • 2013
  • In many enterprises, fraudulent activities and processes are widely prevalent. But, their employees would not report the illegal activities since they would be attacked by defensive and reactive retaliations in their enterprises. Against this backdrop, we design notification systems for whistle blowing. The design would certainly be useful for fraudulent process notification while using management information systems in the field of business. The fraudulent process notification is related to whistle blowing systems, methods, storage media, and so on. Also, we establish the whole architecture of fraudulent process notification with functional structure from the viewpoint of systems and whistle blower. The flow diagram of notification method is added.

  • PDF

Application Plan of Big Data and NoSQL (빅데이터와 NoSQL 활용방안)

  • Park, Sungbum;Lee, Sangwon;Ahn, Hyunsup;Jung, In-Hwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.223-225
    • /
    • 2013
  • For a long time, Relational Databases have been widely used in many enterprises. Even though the Relational Databases have merits such as excellent power of data preservation, concurrency controlling as a standard model in databases, there are a demerit in the inconsistency of objects and relations. Against this backdrop, NoSQL is being magnified as a new solution for Big Data since it can be operated without any schema. In this paper, we research on not only merits and demerits of Relational Databases but also the comparison between application databases and integrated databases. And then, we define NoSQL for Big Data and check its characteristics.

  • PDF

Investigation of Goyang Tornado Outbreak Using X-band Polarimetric Radar: 10 June 2014 (X밴드 이중편파레이더를 활용한 고양 토네이도 발생 사례 분석: 2014년 6월 10일)

  • Jeong, Jong-Hoon;Kim, Yeon-Hee;Oh, Su-Bin;Lim, Eunha;Joo, Sangwon
    • Atmosphere
    • /
    • v.26 no.1
    • /
    • pp.47-58
    • /
    • 2016
  • On 10 July 2014, tornado outbreak occurred over Goyang province in Korea. This was the first supercell tornado ever reported or documented in Korea. The characteristics of the supercell tornado were investigated using an X-band polarimetric radar, surface meteorological observation, wind profiler, and operational numerical weather prediction (Regional Data Assimilation and Prediction System, RDAPS). The supercell tornado developed along a preexisting dryline that was contributed to surface wind shear. The radar analyses examined here show that the supercell tornado indicated a hook echo with mesocyclone. The decending reflectivity core as well was detected before tornadogenesis and prior to intensification of supercell. The supercell tornado exhibited characteristics similar to typical supercell tornado over the Great Plains of the United States, such as hook echo, bounded weak echo region, and slower movement speed relative to the mean wind. Compared to the typical supercell tornado over U.S., this tornado showed horizontal scale of the mesocyclone was relatively smaller and left-mover.

Design of Infrastructure to Analyze Big Data (빅데이터 분석을 위한 인프라 설계)

  • Park, Sungbum;Lee, Sangwon;Ahn, Hyunsup;Jung, In-Hwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.202-204
    • /
    • 2013
  • Nowadays, owing to the development of hardware, most of enterprises should operate and manage bigger amount of data than they used to do in the past. For this reason, the enterprises ceaselessly and urgently need systemized tools, platforms, and analysis methodologies in order to collect, store, and handle explosively increasing data. In this paper, we firstly understand key elements of Big Data, and secondly define critical factors for Big Data application with these elements. Thirdly, we research on various analysis techniques for Big Data analysis. Lastly, we propose an infrastructure to analyze bid data.

  • PDF

Application Plan of Graph Databases in the Big Data Environment (빅데이터환경에서의 그래프데이터베이스 활용방안)

  • Park, Sungbum;Lee, Sangwon;Ahn, Hyunsup;Jung, In-Hwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.247-249
    • /
    • 2013
  • Even though Relational Databases have been widely used in many enterprises, the relations among entities are not managed effectively and efficiently. In order to analyze Big Data, it is absolutely needed to express various relations among entities in a graphical form. In this paper, we define Graph Databases and its structure. And then, we check out their characteristics such as transaction, consistency, availability, retrieval function, and expandability. Also, we appropriate or inappropriate subjects for application of Graph Databases.

  • PDF

Selection Analysis of Databases to Manage Big Data (빅데이터 관리를 위한 데이터베이스 선정분석)

  • Park, Sungbum;Lee, Sangwon;Ahn, Hyunsup;Jung, In-Hwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.258-260
    • /
    • 2013
  • There are two major factors to use NoSQL in order to manage Big Data; to increase productivity of an application programmer and to increase data access performance. But, in many business fields, this hopeful plan lacks careful consideration. For efficient and effective management and analysis of Big Data, it is necessary to perform a test with the expectation for productivity and performance of the application programmer before deciding whether NoSQL technique is used or not. In this paper, we research on programmer productivity, data access performance, risk distribution, and so forth.

  • PDF

Application Plan of Document Databases in the Big Data Environment (빅데이터환경에서의 문서데이터베이스 활용방안)

  • Park, Sungbum;Lee, Sangwon;Ahn, Hyunsup;Jung, In-Hwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.230-232
    • /
    • 2013
  • For Many enterprises are creating and handling huge amount of data in their business administration. However, it would be impossible for general databases such as Relational Databases, hierarchical databases, and network databases to manage and analyze this large amount of document data efficiently and effectively. So, in this paper, we define document databases and check out their characteristics such as consistency and transaction. And we propose appropriate or inappropriate subjects for application of document databases.

  • PDF

Factors Influencing New Media Subscription Based on Multigroup Analysis of IPTV and DCTV

  • Kang, Sang-Ug;Park, Seungbum;Lee, Sangwon
    • ETRI Journal
    • /
    • v.36 no.6
    • /
    • pp.1041-1050
    • /
    • 2014
  • As the Internet Protocol TV (IPTV) service enters the broadcasting market, the competition intensifies. This paper explains the factors influencing new media subscription and their influential differences on IPTV and digital cable TV (DCTV). We use the information systems success model and gratification opportunity theory to develop our research model. We sample 621 people and collect their responses through web-based measuring software. Structural model analysis shows that the willingness to subscribe to a new broadcasting medium is influenced by three characteristics of the medium: media richness, interactivity, and video quality. Multigroup analysis reveals that motivation to use a medium partially differs between IPTV and DCTV. This research concludes that the IPTV service is not attractive enough to act as a substitute for the already existing DCTV. In addition, for the IPTV service to proliferate, its business model should be promoted with new and differentiated revenue structures and services. The managerial implications in this study help new media businesses set business goals and product functionality, and allocate resources for the continued diffusion of IPTV.

9f-leveling: An Efficient Wear-leveling Scheme for Flash Memory (K-평준화: 플래시 메모리의 효율적인 소거 횟수 평준화 기법)

  • Kim Do Yun;Yoo Hyun-Seok;Park Sung-Hwan;Park Won-Joo;Park Sangwon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07a
    • /
    • pp.787-789
    • /
    • 2005
  • 최근 이동성이 중요한 요소로 차지하는 기기들이 등장하면서 플래시 메모리가 각광을 받고 있다. 플래시 메모리의 소형화, 대용량화, 저전력화, 비휘발성, 고속화 그리고 충격에 강한 장점으로 인하여 많은 응용에서 디스크를 대체할 것으로 예상된다. 하지만 이런 플래시 메모리는 데이터를 기록하기 전에 해당 블록이 미리 소거가 되어야 하는 제약 조건을 가지고 있으며 각 블록들의 최대 소거 횟수가 제한되어 있다는 한계가 있다. 이때 소거 연산이 특정 블록에 집중되어 특정 블록의 수명이 단축되는 문제점을 해결하기 위하여 블록에 대한 소거 횟수 평준화 기법(wear-leveling)이 필요하다. 기존에 제안된 소거 횟수 평준화 기법은 각 블록의 소거 횟수를 유지해야하는 비용이 필요로 하거나 플래시 메모리가 대용량일 경우에는 블록 영역을 이동시키는데 비용이 발생하는 문제가 있다. 본 논문에서는 플래시 메모리의 소거 횟수 평준화를 위하여 해당 블록의 소거 횟수에 대한 정보의 유지의 부담을 줄이고 플래시 메모리의 대용량화 및 디스크 대체 시에 효율적인 소거 횟수 평준화 기법을 제안하고, 실험을 통하여 성능의 우수함을 보인다.

  • PDF

PIX: Partitioned Index for Keyword Search over XML Documents (PIX: XML문서 검색을 위한 색인 분할 기법)

  • Lee Hongrae;Lee Hyungdong;Yoo Sangwon;Kim Hyoung-Joo
    • Journal of KIISE:Databases
    • /
    • v.31 no.6
    • /
    • pp.710-720
    • /
    • 2004
  • As XML documents have much richer information than plain texts, we can perform very elaborated, fine-grained search which was difficult in past years. However, as the cost of finer grained element level search is very high, the processing overhead has become a new challenge. We propose an inverted index structure called PIX, which reduces the number of elements processed by partitioning elements according to their match potentiality. We choose a base level and partition elements according to whether they have possibility of having a common ancestor higher than the level. We also propose partition merging technique by which we can get same results as unpartitioned case. Our experimental results show that the index partitioning strategy can reduce processing time considerably.