• Title/Summary/Keyword: Stream Graphs

Search Result 11, Processing Time 0.027 seconds

A Study on Evaluation Method of Stream Naturalness for Ecological Restoration of Stream Corridors (우리나라 중소하천 코리도의 자연성 평가기법 연구)

  • 조용현
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.25 no.2
    • /
    • pp.73-81
    • /
    • 1997
  • The main purpose of this study was to develop a new method for evaluation of stream naturalness in order to appraise and prescribe for streams effectively in the process of ecological restoration of stream corridors. The results are as follows : 1) For this purpose six factors were selected on considering the spatial axes of stream corridor variation and total 20 descriptors about the physical structure were selected. 2) The calculation of S.N.I. for each segment was consisted of three steps, such as calculation of S.N.I.s of the individual descriptors, averaging all the descriptors's for each factor, and finally averaging the factors's for the Total S.N.I. 3) The evaluation unit was decided to be 100m size. The score system ranging 1~5 was adopted. Weighting parameters of factors were unified with each other. 4) A GIS model was adopted for classification, calculation, querying, analysing, and presenting S.N.I. information. And the format of S.N.I. maps including statistical graphs and other spatial watershed information was designed for the GIS odel. The naturalness of stream corridor was was investigated by the naturalness of habitat, and assessed by the descriptors focused on physical structure, therefore the S.N.I. can manifest prescriptions for restoration of the stream corridor. On the other hand because some evaluation factors such as water quality, water volume, fauna, flora, functions of stream exosystem has been excluded, S.N.I. could have some limits on representing the full aspects of stream naturalness. This evaluation method is hypothetical one, so it would be investigated through iterative applicatons.

  • PDF

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

The Study for Implementation method of Concurrency Control for DataBase Flow Graphs (DBFG를 이용한 동시성제어 구현 방법에 관한 연구)

  • 남태희;위승민
    • Journal of the Korea Society of Computer and Information
    • /
    • v.1 no.1
    • /
    • pp.147-158
    • /
    • 1996
  • This paper proposed a concurrency control structure based on specialized data flow graphs that was analysed a run-time concurrency control activity to be integrated with the task scheduler Data were viewed as flowing on the arcs from one node to another in a stream of discrete to tokens. The network that Is based upon the Entity-Relationship model, can be viewed a fixed problems used query tokens as a data flow graph. The performance was measured used in the various expriments compared the overall performance of the different concurrency control methods, DBFG (DataBase Flow graphs) scheduling had the knowledge to obtain better performance than 2PL in a distributed environment.

  • PDF

COMPUTATIONS OF NATURAL CONVECTION FLOW WITHIN A SQUARE CAVITY BY HERMITE STREAM FUNCTION METHOD (Hermite 유동함수법에 의한 정사각형 공동 내부의 자연대류 유동계산)

  • Kim, J.W.
    • Journal of computational fluids engineering
    • /
    • v.14 no.4
    • /
    • pp.67-77
    • /
    • 2009
  • This paper is a continuation of a recent development on the Hermite-based divergence-free element method and deals with a non-isothermal fluid flow driven by the buoyancy force in a square cavity with temperature difference across the two sides. Two Hermite functions are considered for numerical computations in this paper. One is a cubic function and the other is a quartic function. The degrees-of-freedom of the cubic Hermite function are stream function and its first and second derivatives for the velocity field, and temperature and its first derivatives for the temperature field. The degrees-of-freedom of the quartic Hermite function include two second derivatives and one cross derivative of the stream function in addition to the degrees-of-freedom of the cubic stream function. This paper presents a brief review on the Hermite based divergence-free basis functions and its finite element formulations for the buoyancy driven flow. The present algorithm does not employ any upwinding or a stabilization term. However, numerical values and contour graphs for major flow variables showed good agreements with those by De Vahl Davis[6].

A Mapping Method of Data-flow graphs into Systolic Arrays (Data-flow graph 로부터 Systolic Array에의 변환방법)

  • Park, Myong-Soon;Jhon, C.S.
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1121-1124
    • /
    • 1987
  • Previous methods to map from a FORTRAN-like specification into a systolic array were difficult to find data dependencies because the specification was expressed and executed sequentially. Data-flow graph(DFG)s show data dependencies explicitly. In this paper we show a mapping tool from a DFG specification into a systolic array. We introduce the concept of a Systolic Pattern Stream(SPS) and use that concept to derive a systolic array.

  • PDF

Classification of Public Perceptions toward Smog Risks on Twitter Using Topic Modeling (Topic Modeling을 이용한 Twitter상에서 스모그 리스크에 관한 대중 인식 분류 연구)

  • Kim, Yun-Ki
    • Journal of Cadastre & Land InformatiX
    • /
    • v.47 no.1
    • /
    • pp.53-79
    • /
    • 2017
  • The main purpose of this study was to detect and classify public perceptions toward smog disasters on Twitter using topic modeling. To help achieve these objectives and to identify gaps in the literature, this research carried out a literature review on public opinions toward smog disasters and topic modeling. The literature review indicated that there are huge gaps in the related literature. In this research, this author formed five research questions to fill the gaps in the literature. And then this study performed research steps such as data extraction, word cloud analysis on the cleaned data, building the network of terms, correlation analysis, hierarchical cluster analysis, topic modeling with the LDA, and stream graphs to answer those research questions. The results of this research revealed that there exist huge differences in the most frequent terms, the shapes of terms network, types of correlation, and smog-related topics changing patterns between New York and London. Therefore, this author could find positive answers to the four of the five research questions and a partially positive answer to Research question 4. Finally, on the basis of the results, this author suggested policy implications and recommendations for future study.

Multiple Multicast Tree Allocation Algorithm in Multicast Network

  • Lee Chae Y.;Cho Hee K.
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2002.05a
    • /
    • pp.120-127
    • /
    • 2002
  • The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols and construct multicast routing graphs for a single multicast group. However. there have been few researches about the relation between multiple and concurrent multicast groups. In this paper, the multiple multicast tree allocation algorithm to avoid congestion is proposed. The multicast group with different bandwidth requirement is also considered. A two-phase algorithm is proposed. The first phase is for basic search and the second phase for further improvement. The performance of the proposed algorithm is experimented with computational results. Computational results show that the proposed algorithm outperforms an existing algorithm.

  • PDF

Numerical Study of the Magnetohydrodynamic Heat Transfer Peristaltic Flow in Tube Against High Reynolds Number

  • Hamid, A.H.;Javed, Tariq;Ali, N.
    • Journal of the Korean Physical Society
    • /
    • v.73 no.9
    • /
    • pp.1295-1302
    • /
    • 2018
  • In the present investigation, we have studied the magnetohydrodynamic (MHD) heat transfer of peristaltic flow in a tube. The analysis is made without imposing any assumption to obtain the streamline and isothermal line directly. Galerkin's finite element method has been used on the governing Navier-Stoke's equation in the form of ${\psi}-{\omega}$. The graphs of the computed longitudinal velocity, temperature and pressure are plotted against different value of the emerging parameter by using the stream function and vorticity. The results are valid beyond the long wavelength and the low Reynolds number limits. We conclude that higher values of the parameters are not independent of the time mean flow rate.

Comparison of IUHs obtained by the Derived and Simple Equation of GIUH on Third and Fourth-Order Streams (3, 4차 하천에서의 GIUH 유도식과 간략식에 의해 산정된 순간단위도의 비교연구)

  • Joo, Jin-Gul;Ham, Dae-Heon;Jun, Hwan-Don;Lee, Jung-Ho;Kim, Joong-Hoon
    • Journal of Korea Water Resources Association
    • /
    • v.41 no.11
    • /
    • pp.1107-1121
    • /
    • 2008
  • The simple equation of GIUH are frequently used in many researches instead of the derived equation of GIUH. However it is still unknown whether the simple equation of GIUH is adaptable for estimating IUHs for basins with various geomorphologic conditions. To verify the applicability of the simple equation of GIUH, in this research, four basins which were Bangrim, Sanganmi, Museong, and Byeongcheon were selected and each basin was assumed as the third and fourth stream order basin according to variable resolutions. After than, IUHs were estimated using the derived and simple equations of GIUH. Eight to sixteen hydrographs were estimated from the each IUH, compared with observed graphs. In case of that the basin is assumed as a third order stream, the derived equation underestimated the peak flows while the simple equation overestimated them. When the basin is assumed as a fourth order stream, the simple equation generally overestimated the peak flows whereas the derived equation produced peak flows good agreement with the observed peak flow. Moreover, the simple equation showed various deviations in accuracy whereas the derived equation produced stable results. Based on the fact found from this research, it can be concluded that the derived equation of GIUH brings better results than the simple equation of GIUH to estimate IUHs for ungauged basins.

GUI-based Detection of Usage-state Changes in Mobile Apps (GUI에 기반한 모바일 앱 사용상태 구분)

  • Kang, Ryangkyung;Seok, Ho-Sik
    • Journal of IKEEE
    • /
    • v.23 no.2
    • /
    • pp.448-453
    • /
    • 2019
  • Under the conflicting objectives of maximum user satisfaction and fast launching, there exist great needs for automated mobile app testing. In automated app testing, detection of usage-state changes is one of the most important issues for minimizing human intervention and testing of various usage scenarios. Because conventional approaches utilizing pre-collected training examples can not handle the rapid evolution of apps, we propose a novel method detecting changes in usage-state through graph-entropy. In the proposed method, widgets in a screen shot are recognized through DNNs and 'onverted graphs. We compared the performance of the proposed method with a SIFT (Scale-Invariant Feature Transform) based method on 20 real-world apps. In most cases, our method achieved superior results, but we found some situations where further improvements are required.