• Title/Summary/Keyword: graph type

Search Result 329, Processing Time 0.025 seconds

A Query Language for Multimedia Presentation Graphs and Query Processing Techniques with Algebra (멀티미디어 상연그래프 질의언어와 대수를 이용한 질의처리방법)

  • Lee, Tae-Kyong
    • Journal of KIISE:Databases
    • /
    • v.27 no.2
    • /
    • pp.185-198
    • /
    • 2000
  • Recently the technological advance in the hardware dealing with multimedia data as well as the explosive increase of the volume of multimedia data bring about new interest in the use of multimedia presentations in many application domains. To use multimedia presentations efficiently, the integration of multimedia presentations into DBMS is necessary. This paper presents a multimedia presentatation query language based on contents and query processing techniques. Presently, multimedia presentation authoring tools denote a multimedia presentation using a presentation graph which is a DAG. A Node in the graph is a same type of media stream and edges denote a play-out order and a synchronization way among nodes. The contents of presentations graphs are the information of each stream, the sequential order of the information inside each stream and the play-out order among the streams. GCalculus/S is a calculus-based query language and can deal with the contents of a presentation graph and physical characteristics of multimedia data. It expresses the sequential order of information inside each stream and the play-out order of streams of a presentation graph using temporal operators Next, Connected and Until. O-Algebra, which is object algebra, is extended to process GCalculus/S queries.

  • PDF

Implementation of an Algorithm that Generates Minimal Spanning Ladders and Exploration on its relevance with Computational Thinking (최소생성사다리를 생성하는 알고리즘 구현 및 컴퓨팅 사고력과의 관련성 탐구)

  • Jun, Youngcook
    • The Journal of Korean Association of Computer Education
    • /
    • v.21 no.6
    • /
    • pp.39-47
    • /
    • 2018
  • This paper dealt with investigating the number of minimal spanning ladders originated from ladder game and their properties as well as the related computational thinking aspects. The author modified the filtering techniques to enhance Mathematica project where a new type of graph was generated based on the algorithm using a generator of firstly found minimal spanning graph by repeatedly applying independent ladder operator to a subsequence of ladder sequence. The newly produced YC graphs had recursive and hierarchical graph structures and showed the properties of edge-symmetric. As the computational complexity increased the author divided the whole search space into the each floor of the newly generated minimal spanning graphs for the (5, 10) YC graph and the higher (6, 15) YC graph. It turned out that the computational thinking capabilities such as data visualization, abstraction, and parallel computing with Mathematica contributed to enumerating the new YC graphs in order to investigate their structures and properties.

A Study on The Analysis Method of Problem Solving Results of Linear Functions (일차함수의 문제해결 결과 분석 방법에 관한 연구)

  • Jang, Cheong Hee;Han, Ju-Wan
    • Journal of the Korean School Mathematics Society
    • /
    • v.25 no.1
    • /
    • pp.79-104
    • /
    • 2022
  • It is very important to help students learn by examining how well students solve math problems. Therefore, in this study, four methods(error analysis by problem type, schematization analysis, area graph analysis, and broken line graph analysis) were constructed to analyze how the connectivity between concepts of middle school functions affects the problem solving results. The students' learning situation was visually expressed to enable intuitive understanding. This analysis method makes it easy to understand the evaluation results of students. It can help students learn by understanding their learning situation. It will be useful in mathematics teaching and learning as it can help students to monitor their own problems and make a self-directed learning plan.

Graph Reasoning and Context Fusion for Multi-Task, Multi-Hop Question Answering (다중 작업, 다중 홉 질문 응답을 위한 그래프 추론 및 맥락 융합)

  • Lee, Sangui;Kim, Incheol
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.10 no.8
    • /
    • pp.319-330
    • /
    • 2021
  • Recently, in the field of open domain natural language question answering, multi-task, multi-hop question answering has been studied extensively. In this paper, we propose a novel deep neural network model using hierarchical graphs to answer effectively such multi-task, multi-hop questions. The proposed model extracts different levels of contextual information from multiple paragraphs using hierarchical graphs and graph neural networks, and then utilize them to predict answer type, supporting sentences and answer spans simultaneously. Conducting experiments with the HotpotQA benchmark dataset, we show high performance and positive effects of the proposed model.

A Study on Characteristics of Modern Museum Architecture's Visual Circulation - Focused on Space Syntax and Visibility Graph Analysis - (현대뮤지엄 건축의 시각동선(視覺動線) 특성에 관한 연구 - 공간구문론(Space Syntax)과 가시장분석(Visibility Graph Analysis)을 중심으로 -)

  • Park, Chong-Ku;Lee, Sung-Hoon
    • Korean Institute of Interior Design Journal
    • /
    • v.19 no.4
    • /
    • pp.74-81
    • /
    • 2010
  • This study analyzed characteristics of visual circulation in the modern museum architecture while carrying out space syntax and visibility graph analysis side by side in order to solve problems of visitors' movement having been suggested as the point at issue at modern museum architecture that has become big scaled and layering so as to satisfy various social demands. Also, the result of this analysis is same as followings. First, visitors become to watch the exhibition with clear position that can make themselves in right allocation, and thus visual and perceptual confusions were shown as relatively low in case physical position and visual one were matched at major space of atrium type or mediation space. Second, it was appeared a lot at the museum having exhibition space of room type in case the physical position and visual one were not matched. Visual circulation in the exhibition space of room type has a merit of forming the circulation where free selection is possible. However, it have raised concerns that visual passageway of visitors could be in a stalemate or crash at the opening part, not at the exhibition hall. Third, though analysis of space syntax had a merit of analyzing total modern museum architectures having became compounded and big scaled, but it was dropped in reliability from the visual circulation's analysis that was decided by flows of space and time. In contrary, visibility graph analysis was shown as having a merit to analyzing the flows rather than that of total structure, and also appeared as being able to supplement the disadvantage of space syntax in methodology. Upon the above analysis, a lot of architectural elements such as allocation of exhibition hall, location of door and window etc. were appeared as affecting influences to forming visual circulation of visitors, not to mention of allocations of major space, mediation space, and exhibition one. Through this study, various possibilities of quantitative analysis on the visual circulation in the museum architectures can be confirmed. However, this study expects that in-depth subsequent researches objecting to various museums could be realized afterwards because there are still limitations in its analysis.

Switching Element Disjoint Multicast Scheduling for Avoiding Crosstalk in Photonic Banyan-Type Switching Networks(Part I):Graph Theoretic Analysis of Crosstalk Relationship (광 베니언-형 교환 망에서의 누화를 회피하기 위한 교환소자를 달리하는 멀티캐스트 스케줄링(제1부):누화 관계의 그래프 이론적 분석)

  • Tscha, Yeong-Hwan
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.3
    • /
    • pp.447-453
    • /
    • 2001
  • In this paper, we consider the scheduling of SE(switching element)-disjoint multicasting in photonic Banyan-type switching networks constructed with directional couplers. This ensures that at most, one connection holds each SE in a given time thus, neither crosstalk nor blocking will arise in the network. Such multicasting usually takes several routing rounds hence, it is desirable to keep the number of rounds(i.e., scheduling length) to a minimum. We first present the necessary and sufficient condition for connections to pass through a common SE(i.e., make crosstalk) in the photonic Banyan-type networks capable of supporting one-to-many connections. With definition of uniquely splitting a multicast connection into distinct subconnections, the crosstalk relationship of a set of connections is represented by a graph model. In order to analyze the worst case crosstalk we characterize the upper bound on the degree of the graph. The successor paper(Part II)[14] is devoted to the scheduling algorithm and the upper bound on the scheduling length. Comparison with related results is made in detail.

  • PDF

A Effective Ant Colony Algorithm applied to the Graph Coloring Problem (그래프 착색 문제에 적용된 효과적인 Ant Colony Algorithm에 관한 연구)

  • Ahn, Sang-Huck;Lee, Seung-Gwan;Chung, Tae-Choong
    • The KIPS Transactions:PartB
    • /
    • v.11B no.2
    • /
    • pp.221-226
    • /
    • 2004
  • Ant Colony System(ACS) Algorithm is new meta-heuristic for hard combinational optimization problem. It is a population-based approach that uses exploitation of positive feedback as well as greedy search. Recently, various methods and solutions are proposed to solve optimal solution of graph coloring problem that assign to color for adjacency node($v_i, v_j$) that they has not same color. In this paper introducing ANTCOL Algorithm that is method to solve solution by Ant Colony System algorithm that is not method that it is known well as solution of existent graph coloring problem. After introducing ACS algorithm and Assignment Type Problem, show the wav how to apply ACS to solve ATP And compare graph coloring result and execution time when use existent generating functions(ANT_Random, ANT_LF, ANT_SL, ANT_DSATUR, ANT_RLF method) with ANT_XRLF method that use XRLF that apply Randomize to RLF to solve ANTCOL. Also compare graph coloring result and execution time when use method to add re-search to ANT_XRLF(ANT_XRLF_R) with existent generating functions.

Question and Answering System through Search Result Summarization of Q&A Documents (Q&A 문서의 검색 결과 요약을 활용한 질의응답 시스템)

  • Yoo, Dong Hyun;Lee, Hyun Ah
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.4
    • /
    • pp.149-154
    • /
    • 2014
  • A user should pick up relevant answers by himself from various search results when using user participation question answering community like Knowledge-iN. If refined answers are automatically provided, usability of question answering community must be improved. This paper divides questions in Q&A documents into 4 types(word, list, graph and text), then proposes summarizing methods for each question type using document statistics. Summarized answers for word, list and text type are obtained by question clustering and calculating scores for words using frequency, proximity and confidence of answers. Answers for graph type is shown by extracting user opinion from answers.

A Study on the relationship in spatial structure of senior Center in Seoul (서울시 노인종합복지관의 공간 구조적 연결 관계에 관한 연구)

  • Kim, Jin-A;Byun, Dae-Joong
    • Korean Institute of Interior Design Journal
    • /
    • v.21 no.3
    • /
    • pp.182-193
    • /
    • 2012
  • The percentage of senior citizens is increasing in Korea and it is expected to become an "aging society". Problems with the elderly are becoming a big concern, such as physical and mental illness, losing their jobs and having difficulties at home. But, the silver generation, as they are being known, has changed a lot these days. With the aid of medical developments, the elderly's lifespan has become longer, making them more independent and active. Senior Welfare Center's are places where the elderly can spend their golden years in comfort, meaningfully. Senior Welfare Center's these days provide many different programs, which naturally lead to an increase in elderly users. With the rise in welfare centers and users, research on the subject also grew. As this topic has only recently become an issue, there were not many spatial structure studies considering elderly movement. Therefore, there should be spatial structure research that considers older users space awareness and how it can be managed effectively. The goal of this study is to present basic resources for providing a comfortable senior welfare center for elders. This will be based on quantitative analysis derived from spatial structure research along with special construction characteristics based on the institution's general plan. As a research method, Senior Welfare Center's will be categorized into corridor type, hall type, and hybrid types which then be reproduced into a j-graph. Based on this, special structure characteristics and connection links will be comprehended. Then the connection link will be analyzed based on the space syntax result calculated from each type's integration, connectivity, control value, and intelligibility. The analysis result shows that Senior Welfare Center j-graph's average arrangement is hybrid>corridor>hall types. Those elders lacking awareness need easily perceivable spatial structure's and hall type's would be the best choice to increase their awareness as it has high articulation. However, hall type's would be difficult to construct with the size increase, so hybrid type would be the next logical solution. Space with relatively high articulation will need to be planned in hybrid type's where rest areas can be created within the halls in the Welfare Center in connection to its corridors.

  • PDF

High School Students' Errors in Constructing and Interpreting Science Graph (고등학생들의 과학 그래프 작성 및 해석 과정에서 나타난 오류)

  • Kim, You-Jung;Choi, Gil-Soon;Noh, Tae-Hee
    • Journal of The Korean Association For Science Education
    • /
    • v.29 no.8
    • /
    • pp.978-989
    • /
    • 2009
  • In this study, we investigated high school students' errors in constructing and interpreting graph on experimental results by students' science achievement level. Two tests regarding constructing and interpreting graph about 'the relationship between the pressure and volume of a gas' were administered to 11th-graders (N=140). Analysis of the results revealed that most students exhibited many errors in the processes of constructing and interpreting graph. In the processes of constructing graph, there were 16 types of errors on the categories of 'misinterpreting the variables', 'mis-marking the graphical elements', and 'misusing the data'. The students of lower achievement level had more errors than those of higher achievement level in the four error types, that is, 'missing the variables', 'representing the best fit line using a broken line', 'adding the data', and 'neglecting the data'. However, the results were reversed in the error type of 'not marking the origin.' In the processes of interpreting graph, there were 9 types of errors on 'misreading the data', 'wrong interpolation and extrapolation', and 'establishing the wrong relationship'. The students of lower achievement level had more errors than those in the higher achievement level in the error types of 'wrong interpolation' and 'misdescribing the relationship between variables'. Educational implications of the findings are discussed.