• 제목/요약/키워드: 데이터의표현방법

Search Result 1,964, Processing Time 0.04 seconds

Seeking for a Curriculum of Dance Department in the University in the Age of the 4th Industrial Revolution (4차 산업혁명시대 대학무용학과 커리큘럼의 방향모색)

  • Baek, Hyun-Soon;Yoo, Ji-Young
    • Journal of Korea Entertainment Industry Association
    • /
    • v.13 no.3
    • /
    • pp.193-202
    • /
    • 2019
  • This study focuses on what changes are required as to a curriculum of dance department in the university in the age of the 4th industrial revolution. By comparing and analyzing the curricula of dance department in the five universities in Seoul, five academic subjects as to curricula of dance department, which covers what to learn for dance education in the age of the 4th industrial revolution, are presented. First, dance integrative education, the integration of creativity and science education, can be referred to as a subject that stimulates ideas and creativity and raises artistic sensitivity based on STEAM. Second, the curriculum characterized by prediction of the future prospect through Big Data can be utilized well in dealing with dance performance, career path of dance-majoring people, and job creation by analyzing public opinion, evaluation, and feelings. Third, video education. Seeing the images as modern major media tends to occupy most of the expressive area of art, dance by dint of video enables existing dance work to be created as new form of art, expanding dance boundaries in academic and performing art viewpoint. Fourth, VR and AR are essential techniques in the era of smart media. Whether upcoming dance studies are in the form of performance or education or industry, for VR and AR to be digitally applied into every relevant field, keeping with the time, learning about VR and AR is indispensable. Last, the 4th industrial revolution and the curriculum of dance art are needed to foresee the changes in the 4th industrial revolution and to educate changes, development and seeking in dance curriculum.

Knowledge graph-based knowledge map for efficient expression and inference of associated knowledge (연관지식의 효율적인 표현 및 추론이 가능한 지식그래프 기반 지식지도)

  • Yoo, Keedong
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.4
    • /
    • pp.49-71
    • /
    • 2021
  • Users who intend to utilize knowledge to actively solve given problems proceed their jobs with cross- and sequential exploration of associated knowledge related each other in terms of certain criteria, such as content relevance. A knowledge map is the diagram or taxonomy overviewing status of currently managed knowledge in a knowledge-base, and supports users' knowledge exploration based on certain relationships between knowledge. A knowledge map, therefore, must be expressed in a networked form by linking related knowledge based on certain types of relationships, and should be implemented by deploying proper technologies or tools specialized in defining and inferring them. To meet this end, this study suggests a methodology for developing the knowledge graph-based knowledge map using the Graph DB known to exhibit proper functionality in expressing and inferring relationships between entities and their relationships stored in a knowledge-base. Procedures of the proposed methodology are modeling graph data, creating nodes, properties, relationships, and composing knowledge networks by combining identified links between knowledge. Among various Graph DBs, the Neo4j is used in this study for its high credibility and applicability through wide and various application cases. To examine the validity of the proposed methodology, a knowledge graph-based knowledge map is implemented deploying the Graph DB, and a performance comparison test is performed, by applying previous research's data to check whether this study's knowledge map can yield the same level of performance as the previous one did. Previous research's case is concerned with building a process-based knowledge map using the ontology technology, which identifies links between related knowledge based on the sequences of tasks producing or being activated by knowledge. In other words, since a task not only is activated by knowledge as an input but also produces knowledge as an output, input and output knowledge are linked as a flow by the task. Also since a business process is composed of affiliated tasks to fulfill the purpose of the process, the knowledge networks within a business process can be concluded by the sequences of the tasks composing the process. Therefore, using the Neo4j, considered process, task, and knowledge as well as the relationships among them are defined as nodes and relationships so that knowledge links can be identified based on the sequences of tasks. The resultant knowledge network by aggregating identified knowledge links is the knowledge map equipping functionality as a knowledge graph, and therefore its performance needs to be tested whether it meets the level of previous research's validation results. The performance test examines two aspects, the correctness of knowledge links and the possibility of inferring new types of knowledge: the former is examined using 7 questions, and the latter is checked by extracting two new-typed knowledge. As a result, the knowledge map constructed through the proposed methodology has showed the same level of performance as the previous one, and processed knowledge definition as well as knowledge relationship inference in a more efficient manner. Furthermore, comparing to the previous research's ontology-based approach, this study's Graph DB-based approach has also showed more beneficial functionality in intensively managing only the knowledge of interest, dynamically defining knowledge and relationships by reflecting various meanings from situations to purposes, agilely inferring knowledge and relationships through Cypher-based query, and easily creating a new relationship by aggregating existing ones, etc. This study's artifacts can be applied to implement the user-friendly function of knowledge exploration reflecting user's cognitive process toward associated knowledge, and can further underpin the development of an intelligent knowledge-base expanding autonomously through the discovery of new knowledge and their relationships by inference. This study, moreover than these, has an instant effect on implementing the networked knowledge map essential to satisfying contemporary users eagerly excavating the way to find proper knowledge to use.

Identification of a Locus Associated with Resistance to Phytophthora sojae in the Soybean Elite Line 'CheonAl' (콩 우수 계통 '천알'에서 발견한 역병 저항성 유전자좌)

  • Hee Jin You;Eun Ji Kang;In Jeong Kang;Ji-Min Kim;Sung-Taeg Kang;Sungwoo Lee
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.68 no.3
    • /
    • pp.134-146
    • /
    • 2023
  • Phytophthora root rot (PRR) is a major soybean disease caused by an oomycete, Phytophthora sojae. PRR can be severe in poorly drained fields or wet soils. The disease management primarily relies on resistance genes called Rps (resistance to P. sojae). This study aimed to identify resistance loci associated with resistance to P. sojae isolate 40468 in Daepung × CheonAl recombinant inbred line (RIL) population. CheonAl is resistant to the isolate, while Daepung is generally susceptible. We genotyped the parents and RIL population via high-throughput single nucleotide polymorphism genotyping and constructed a set of genetic maps. The presence or absence of resistance to P. sojae was evaluated via hypocotyl inoculation technique, and phenotypic distribution fit to a ratio of 1:1 (R:S) (χ2 = 0.57, p = 0.75), indicating single gene mediated inheritance. Single-marker association and the linkage analysis identified a highly significant genomic region of 55.9~56.4 megabase pairs on chromosome 18 that explained ~98% of phenotypic variance. Many previous studies have reported several Rps genes in this region, and also it contains nine genes that are annotated to code leucine-rich repeat or serine/threonine kinase within the approximate 500 kilobase pairs interval based on the reference genome database. CheonAl is the first domestic soybean genotype characterized for resistance against P. sojae isolate 40468. Therefore, CheonAl could be a valuable genetic source for breeding resistance to P. sojae.

A Queriable XML Compression using Inferred Data Types (추론한 데이타 타입을 이용한 질의 가능 XML 압축)

  • ;;Chung Chin-Wan
    • Journal of KIISE:Databases
    • /
    • v.32 no.4
    • /
    • pp.441-451
    • /
    • 2005
  • HTML is mostly stored in native file systems instead of specialized repositories such as a database. Like HTML, XML, the standard for the exchange and the representation of data in the Internet, is mostly resident on native file systems. However. since XML data is irregular and verbose, the disk space and the network bandwidth are wasted compared to those of regularly structured data. To overcome this inefficiency of XML data, the research on the compression of XML data has been conducted. Among recently proposed XML compression techniques, some techniques do not support querying compressed data, while other techniques which support querying compressed data blindly encode data values using predefined encoding methods without considering the types of data values which necessitates partial decompression for processing range queries. As a result, the query performance on compressed XML data is degraded. Thus, this research proposes an XML compression technique which supports direct and efficient evaluations of queries on compressed XML data. This XML compression technique adopts an encoding method, called dictionary encoding, to encode each tag of XML data and applies proper encoding methods for encoding data values according to the inferred types of data values. Also, through the implementation and the performance evaluation of the XML compression technique proposed in this research, it is shown that the implemented XML compressor efficiently compresses real-life XML data lets and achieves significant improvements on query performance for compressed XML data.

Multiscale Modeling and Simulation of Direct Methanol Fuel Cell (직접메탄올 연료전지의 Multiscale 모델링 및 전산모사)

  • Kim, Min-Su;Lee, Young-Hee;Kim, Jung-Hwan;Kim, Hong-Sung;Lim, Tae-Hoon;Moon, Il
    • Membrane Journal
    • /
    • v.20 no.1
    • /
    • pp.29-39
    • /
    • 2010
  • This study focuses on the modeling of DMFC to predict the characteristics and to improve its performance. This modeling requires deep understanding of the design and operating parameters that influence on the cell potential. Furthermore, the knowledge with reference to electrochemistry, transport phenomena and fluid dynamics should be employed for the duration of mathematical description of the given process. Considering the fact that MEA is the nucleus of DMFC, special attention was made to the development of mathematical model of MEA. Multiscale modeling is comprised of process modeling as well as a computational fluid dynamics (CFD) modeling. The CFD packages and process simulation tools are used in simulating the steady-state process. The process simulation tool calculates theelectrochemical kinetics as well as the change of fractions, and at the same time, CFD calculates various balance equations. The integrated simulation with multiscal modeling explains experimental observations of transparent DMFC.

Inclusion Polymorphism과 UML 클래스 다이어그램 구조에 의거한 디자인패턴 해석

  • Lee, Rang-Hyeok;Lee, Hyeon-Woo;Go, Seok-Ha
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2007.05a
    • /
    • pp.55-68
    • /
    • 2007
  • 디자인 패턴은 새롭게 만들어 지는 것이 아니라 기존의 검증된 지식, 관용법, 원칙들을 체계화한 것이다. 다시 말하면 디자인 패턴은 특정한 문제를 해결하기 위한, 검증된 설계 방법에 이름을 붙인 것이다. 그러므로 적절한 디자인 패턴 사용은 1) 개발자들간의 원활한 의사소통에 도움을 주며, 2) 하급자가 고급기술을 쉽게 익힐 수 있도록 할 수 있다. 3) 또한 사용된 디자인이나 아키텍처를 재사용할 수 있도록 하고, 4) 만들어진 시스템의 유지 보수를 보다 쉽게 할 수 있는 등의 장점을 얻을 수 있다. 반면에 필요하지 않은 곳에 까지 디자인패턴을 사용하게 되면 소프트웨어를 복잡하고, 유지보수도 어렵게 만들 수 있다. 디자인 패턴의 분류는 수 많은 패턴을 비슷한 속성을 지닌 그룹들로 조직화 하는 것이다. 이는 개발자가 특정 문제에 맞는 디자인 패턴을 쉽게 선택 할 수 있도록 도와 줄 뿐만 아니라, 디자인 패턴의 주요특성을 빠르게 이해하고 간파 할 수 있게 한다. 그래서 Beck 이 디자인패턴을 소개한 이후 GoF, Buschmann, Grand, Antoy 등은 디자인 패턴을 단순히 열거를 통해 소개하지 않고, 각자의 기준에 따라 체계적으로 분류하여 패턴을 설명 하고 있다. 본 연구는 객체지향 설계의 근본 개념인 Polymorphism (Inclusion Polymorphism) 과 '객체 지향 소프트웨어 설계 원칙' 그리고 이 근본 원칙들이 UML 클래스 다이어그램에 나타나는 구조적 특정에 의거해 디자인 패 턴 해석을 수행 하였다. 본 연구의 목적은 1) 객체지향의 근본 원칙으로 표현 되는 패턴과 2) 설계자의 전문적 인 Art를 포함하고 있는 패턴으로 분류하는데 있다.3: 재미는 용이성을 통해 채택의도에 정의 영향을 미친다. 가설4: 유용성은 채택의도에 정의 영향을 미친다. 가설5: 용이성은 채택의도에 정의 영향을 미친다. 가설6: 용이성은 유용성에 정의 영향을 미친다. 본 연구의 대상은 자발적으로 이러닝을 채택할 수 있는 대학생을 대상으로 하였고, 설문 데이터 분석을 통한 실증연구를 수행하였다. 분석방법으로는 PLS 분석도구를 사용하였다. 분석결과 가설6을 제외하고는 모두 유용한 것으로 입증되었다.97)은 배움의 용이성, 기억의 용이성, 오류, 효율성, 만족성으로 분류하고 있고(Nielsen, 1997), Shneiderman(1998)는 효과성(직무시간, 배움의 시간), 효율성(기억의 지속시간, 오류), 만족도를 품질의 특성으로 분류하였다. 이와 같은 소프트웨어의 품질은 소프트웨어 계획, 개발, 성장과 쇠퇴의 모든 과정에 적용되며, 환경적 변화에 따라 사용자들의 정보욕구를 적절하게 반영하여 만족도를 높이 는 것이라고 요약할 수 있다. 그러나 현재까지 소프트웨어 품질 평가에 대한 연구들 은 보편적인 평가 항목들을 대상으로 측정하여 일반적인 품질기준을 제시하고 있고, 유사한 측정 내용들이 중복되어 있다. 이러한 경향은 산업별 특수성이 강한 소프트웨어에 대해서는 정확한 품질측정이 어려웠고, 품질측정에 대한 신뢰성을 떨어뜨리는 계기가 되었다. 이러한 한계를 극복하고자 나타난 방법론이 최종사용자들의 요구사항을 얼마나 적절하게 시스템에 반영했는지에 대한 사용성(Usability) 측정이다. 사용성에 대한 정의는 사용자들이 실질적으로 일하는 장소에서 직접 사용자들의 시스템 운용실태를 파악하여 문제점을 개선하는 것으로 요약할 수 있다. ISO9124-1

  • PDF

SDP DB Generator Using XML (XML을 이용한 SDP DB 생성기)

  • Yi, Chang-Hwan;Oh, Se-Man
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2001.10b
    • /
    • pp.1163-1166
    • /
    • 2001
  • 최근의 네트워크는 유선에서 무선으로 발전하고 있다. 무선 네트워크 기술은 여러 가지가 있다. 그 중 좁은 영역에서 사용하고 개인적인 용도로 알맞은 것이 블루투스(Bluetooth)이다. 블루투스 기술 표준은 데이터를 전송하는 단순한 통신 방법만을 정의한 것이 아니라, 몇 가지 응용에 대한 표준도 정의되어 있다. 이 응용은 모든 블루투스 기기가 전부 구현해야 하는 것이 아니라, 그 중 기기에 알맞은 것만을 선택해서 구현을 할 수 있도록 되어 있다. 그렇다면 블루투스 기기에서 다른 기기가 제공하는 서비스가 무엇인지를 알아낼 수 있는 방법이 필요하게 된다. 다른 기기의 서비스를 알아내는데 사용되는 블루투스 기술이 SDP 계층 (Service Discovery Protocol Layer) 이다. SDP 계층은 프로토콜만으로 작동 가능한 것이 아니라, 블루투스 기기에서 제공 가능한 서비스와 서비스 속성을 정의한 내부 데이터베이스를 참조해서 작동하게 된다. 이 내부 데이터베이스는 블루투스를 구현하는 사람마다 모두 다르게 구현하고 있다. 그래서 블루투스 서비스와 서비스 속성에 관한 정보는 글과 간단한 도표로만 정의되고 있는 상황이다. 블루투스 서비스와 서비스 속성 정보를 글과 도표가 아닌 XML을 이용한 문서로 표현을 하는 방법이 나타났었다. 그러나 블루투스 기기에서 직접 서비스와 서비스 속성을 기술한 XML 문서를 바탕으로 SDP를 작동시키는 것은 블루투스 기기에 XML 파서를 포함시켜야 한다는 것을 말한다. 대체로 작은 CPU 성능과 적은 메모리를 가지고 있는 블루투스 기기에서는 XML 파서를 포함하는 근 부담이 된다. 이에 본 논문에서는 보편적으로 사용될 수 있는 블루투스 서비스와 서비스 속성을 기술한 XML 문서에서 블루투스 기기에 적합한 내부 정보를 생성하는 생성기를 설계하고 구현을 하였다.보다는 현저히 낮았다. 총 휘발성 유기화합물읜 농도는 실내가 실외 보다 높았다(I/O ratio 2.5). BTEX의 상대적 함량도 실내가 실외보다 높아 실내에도 발생원이 있음을 암시하고 있다. 자료 분석결과 유치원 실내의 벤젠은 실외로부터 유입되고 있었고, 톨루엔, 에틸벤젠, 크실렌은 실외뿐 아니라 실내에서도 발생하고 있었다. 정량한 8개 화합물 각각과 총 휘발성 유기화합물의 스피어만 상관계수는 벤젠을 제외하고는 모두 유의하였다. 이중 톨루엔과 크실렌은 총 휘발성 유기화합물과 좋은 상관성 (톨루엔 0.76, 크실렌, 0.87)을 나타내었다. 이 연구는 톨루엔과 크실렌이 총 휘발성 유기화합물의 좋은 지표를 사용될 있고, 톨루엔, 에틸벤젠, 크실렌 등 많은 휘발성 유기화합물의 발생원은 실외뿐 아니라 실내에도 있음을 나타내고 있다.>10)의 $[^{18}F]F_2$를 얻었다. 결론: $^{18}O(p,n)^{18}F$ 핵반응을 이용하여 친전자성 방사성동위원소 $[^{18}F]F_2$를 생산하였다. 표적 챔버는 알루미늄으로 제작하였으며 본 연구에서 연구된 $[^{18}F]F_2$가스는 친핵성 치환반응으로 방사성동위원소를 도입하기 어려운 다양한 방사성의 약품개발에 유용하게 이용될 수 있을 것이다.었으나 움직임 보정 후 영상을 이용하여 비교한 경우, 결합능 변화가 선조체 영역에서 국한되어 나타나며 그 유의성이 움직임 보정 전에 비하여 낮음을 알 수 있었다. 결론: 뇌활성화 과제 수행시에 동반되는 피험자의 머리 움직임에 의하여 도파민 유리가 과대평가되었으며 이는 이 연구에서 제안한 영상정합을 이용한 움직임 보정기법에 의해서 개선되었다. 답이 없는 문제, 문제 만들기, 일반화가 가능한 문제 등으로 보고, 수학적 창의성 중 특히 확산적 사

  • PDF

Efficient Publishing Spatial Information as GML for Interoperability of Heterogeneous Spatial Database Systems (이질적인 공간정보시스템의 상호 운용성을 위한 효과적인 지리데이터의 GML 사상)

  • 정원일;배해영
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.1
    • /
    • pp.12-26
    • /
    • 2004
  • In the past, geographic data is constructed and serviced through independent formats of its own according to each GIS(Geographic Information System). Recently the provision of interoperability in GIS is important to efficiently apply the various geographic data between conventional GIS's. Whereupon OGC(Open GIS Consortium) proposed GML(Geography Markup Language) to offer the interoperability between heterogeneous GISs in distributed environments. The GML is an XML encoding for the transport and storage of geographic information, including both the spatial and non-spatial properties of geographic features. Also, the GML includes Web Map Server Implementation Specification to service the GML documents. Accordingly the prototype to provide the reciprocal interchange of geographic information between conventional GIS's and GML documents is widely studied. In this paper, we propose a mapping method of geographic in formation between spatial database and GML for the prototype to support the interoperability between heterogeneous geographic information. For this method, firstly the scheme of converting geographic in Formation of the conventional spatial database into the GML document according to the GML specification is explained, and secondly the scheme to transform geographic information of GML documents to geographic data of spatial database is showed. Consequently, the proposed method is applicable to the framework for integrated geographic information services based on Web by making an offer the interoperability between already built geographic information of conventional GIS's using a mapping method of geographic information between spatial database and GML.

  • PDF

Implementation of Unsupervised Nonlinear Classifier with Binary Harmony Search Algorithm (Binary Harmony Search 알고리즘을 이용한 Unsupervised Nonlinear Classifier 구현)

  • Lee, Tae-Ju;Park, Seung-Min;Ko, Kwang-Eun;Sung, Won-Ki;Sim, Kwee-Bo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.4
    • /
    • pp.354-359
    • /
    • 2013
  • In this paper, we suggested the method for implementation of unsupervised nonlinear classification using Binary Harmony Search (BHS) algorithm, which is known as a optimization algorithm. Various algorithms have been suggested for classification of feature vectors from the process of machine learning for pattern recognition or EEG signal analysis processing. Supervised learning based support vector machine or fuzzy c-mean (FCM) based on unsupervised learning have been used for classification in the field. However, conventional methods were hard to apply nonlinear dataset classification or required prior information for supervised learning. We solved this problems with proposed classification method using heuristic approach which took the minimal Euclidean distance between vectors, then we assumed them as same class and the others were another class. For the comparison, we used FCM, self-organizing map (SOM) based on artificial neural network (ANN). KEEL machine learning datset was used for simulation. We concluded that proposed method was superior than other algorithms.

An Ontology-Driven Mapping Algorithm between Heterogeneous Product Classification Taxonomies (이질적인 쇼핑몰 환경을 위한 온톨로지 기반 상품 매핑 방법론)

  • Kim Woo-Ju;Choi Nam-Hyuk;Choi Dae-Woo
    • Journal of Intelligence and Information Systems
    • /
    • v.12 no.2
    • /
    • pp.33-48
    • /
    • 2006
  • The Semantic Web and its related technologies have been opening the era of information sharing via the Web. There are, however, several huddles still to overcome in the new era, and one of the major huddles is the issue of information integration, unless a single unified and huge ontology could be built and used which could address everything in the world. Particularly in the e-business area, the problem of information integration is of a great concern for product search and comparison at various Internet shopping sites and e-marketplaces. To overcome this problem, we proposed an ontology-driven mapping algorithm between heterogeneous product classification and description frameworks. We also peformed a comparative evaluation of the proposed mapping algorithm against a well-Down ontology mapping tool, PROMPT.

  • PDF