• Proceedings of the Korea Contents Association Conference
• /
• 2019.05a
• /
• pp.9-10
• /
• 2019

NGS 분석과정 중 증폭된 DNA 리드(Read)는 중복이 발생하여 이로 인해 다음 단계의 정확도 저하 등의 문제를 야기한다. 이 논문에서는 기존 DNA 리드 중복 제거 도구 중 하나인 Samblaster의 중복제거 알고리즘을 이용하여 분산 병렬 형태로 중복제거를 수행하는 방법을 제안한다. 제안하는 중복제거 방법은 중복제거 전단계인 정렬단계애서 정렬된 리드에 대해 중복제거 키를 생성하고 이를 스트림으로 전달하여 중복제거를 수행한다.

• Proceedings of the Korea Contents Association Conference
• /
• 2017.05a
• /
• pp.313-314
• /
• 2017

이 논문에서는 DNA 분석단계 중 하나인 DNA 리드(Read)에 대한 중복제거 방법을 분산 병렬처리 기법을 적용하여 가속화하는 방법을 제안한다. 기존 제안된 중복제거 기법을 Spark을 기반으로 병렬처리 되도록 하는 접근방법을 취한다. 제안하는 기법은 실험을 통해서 기존 중복제거 기법과 비교하여 성능을 입증한다.

• Digital Contents
• /
• no.11 s.138
• /
• pp.44-46
• /
• 2004

온라인게임 등 콘텐츠 영역에서 갈등,중복의 모습을 비쳐왔던 문화관광부와 정보통신부가 대승적 차원에서 협력을 다짐하며 손을 맞잡았다. 지난달 1일 정동채 문광부 장관과 진대제 정통부 장관은‘문화콘텐츠-디지털콘텐츠 업무협력합의서’를 체결하고, 중복업무가 발생하지 않도록 조정하자는 데 공식 합의했다. 이번 합의서의 체결과정 및 의미, 그리고 업계반응을 살펴봤다.

• Proceedings of the Korea Contents Association Conference
• /
• 2018.05a
• /
• pp.15-16
• /
• 2018

NGS 분석과정에서는 정확도를 높이기 위해서 중합 효소 연쇄반응 (PCR)을 통해 DNA 리드들을 증폭한다. PCR 증폭은 DNA 리드의 중복을 발생시키며 중복으로 인해 NGS 과정의 정확성이 저하되는 문제가 발생한다. 본 논문에서는 DNA 리드 중복을 제거하는 도구중 하나인 Samblaster 의 병렬화를 위한 DNA 리드 분할 방법을 제안한다. DNA 리드를 분할하여 Samblaster를 병렬 실행 하도록 하여 수행시간을 단축 할 수 있도록 한다.

• The Korean Journal of Archival Studies
• /
• no.35
• /
• pp.133-160
• /
• 2013

As the network and electronic devices have been developed rapidly, the influences the web exerts on our daily lives have been increasing. Information created on the web has been playing more and more essential role as the important records which reflect each era. So there is a strong demand to archive information on the web by a standardized method. One of the methods is the snapshot strategy, which is crawling the web contents periodically using automatic software. But there are two problems in this strategy. First, it can harvest the same and duplicate contents and it is also possible that meaningless and useless contents can be crawled due to complex IT skills implemented on the web. In this paper, we will categorize the problems which can emerge when crawling web contents using snapshot strategy and present the possible solutions to settle the problems through the technical aspects by crawling the web contents in the public institutions.

• The Journal of the Korea Contents Association
• /
• v.16 no.1
• /
• pp.470-481
• /
• 2016

The purpose of this study is to identify the actual condition of poly-victimization and examine the difference in the levels of psychological adaptation and delinquency by victimization types among adolescents. A total 6,174 cases from '2013 Adolescent Deviant Behaviors and Policy Issues' of NYPI was used for the analysis. Main findings are that 8.3% of adolescents exposed to more than two types of victimization and 2.1% of them experienced more than three types of victimization. There were significant differences in the levels of psychological adaptation and delinquency by victimization types. Study findings were discussed in terms of implications for research and intervention of adolescent poly-victimization.

• Digital Contents
• /
• no.8 s.99
• /
• pp.39-43
• /
• 2001

정부의 업무 중 각 부처간 영역에 있어 중복 부분은 늘 있게 마련이다. 때문에 정부는 각 부처 간 중복 사업 때문에 언론의 지탄을 받기도 했다. 최근 들어서 IT부문의 중복 투자 및 업무영역 분쟁 등으로 언론에 오르내렸던 부분이 관련 부처의 협의를 통해 수정되었다. 특히, 정통부와 산자부, 정통부와 문화부, 정통부와 공정위 등 IT산업의 특성상 정통부와의 업무 중복 논란이 많았던 점을 감안할때 정통부 업무와 관련한 조정이 많았던 것이 특징이다. 더불어 정통부는 정보통신산업 및 정보화의 종합 조정 부처로서의 역할을 담당한다는 것에 합의안을 도출했다. 관련 기관 및 업계에 정보를 전달하기 위해 지난 7월 13일 최종 합의된 정부부처간 경제정책 조정회의 최종안을 게재한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6C
• /
• pp.520-528
• /
• 2008

At present Content Management Systems (CMS) with various and diverse web contents have been in wide applications. But, for CMS of each enterprise has its own metadata which is very different from others, it causes the serious problem of web contents repetition. Also, it's a difficult technology to support protecting copyright of web contents which are in separated CMSs. Therefore, in this paper, we solved the problem of contents repetition through metadata integration between mutually heterogeneous CMSs. We also propose the technology of web contents authentication code for avoiding contents repetition and applying digital rights protection by supporting safe ship in vast quantity of contents.

• The Journal of the Korea Contents Association
• /
• v.11 no.12
• /
• pp.60-70
• /
• 2011

Conventional content management systems are independently developed for a specific field in general. Therefore usage of contents for the CMS will be limited to the corresponding CMS field. These characteristics might reveal a defect that CMS could not support effectively in exchange and sharing of information between CMSs. On the other hand, metadata standardization shows big differences in method and representation for the fields of CMS because all metadata standardizations are variously performed according to applications of them. There are lots differences that make interoperability between CMSs impossible. In this paper, we propose a novel metadata schema based on METS(metadata encoding and transmission standard) so that metadata standardization can be fulfilled in reality and solved the problem of duplicated contents created from different CMSs. This framework of integrated metadata proposed here can offer an interoperability between contents created by different CMSs, and discard duplicated contents. As a result of the proposed technology, we obtain 0.5% duplication rate from traditional 10.3%. In addition the filtering ability of duplicated contents shows from 92% to 96%, which proves the effectiveness and stability of the proposed technology.

• The Journal of the Korea Contents Association
• /
• v.18 no.2
• /
• pp.438-449
• /
• 2018

Recently, various graph data have been utilized in various fields such as social networks and citation networks. As the graph changes dynamically over time, it is necessary to manage the graph historical data for tracking changes and retrieving point-in-time graphs. Most historical data changes partially according to time, so unchanged data is stored redundantly when data is stored in units of time. In this paper, we propose a graph history storage management method to minimize the redundant storage of time graphs. The proposed method continuously detects the change of the graph and stores the overlapping subgraph in intersection snapshot. Intersection snapshots are connected by a number of delta snapshots to maintain change data over time. It improves space efficiency by collectively managing overlapping data stored in intersection snapshots. We also linked intersection snapshots and delta snapshots to retrieval the graph at that point in time. Various performance evaluations are performed to show the superiority of the proposed scheme.