• Title/Summary/Keyword: 경로 표현식

Search Result 119, Processing Time 0.028 seconds

Path-based Dynamic User Equilibrium Assignment Model using Simulation Loading Method (시뮬레이션 부하기법을 이용한 경로기반 동적통행배정모형의 개발)

  • 김현명;임용택;백승걸
    • Journal of Korean Society of Transportation
    • /
    • v.19 no.3
    • /
    • pp.101-113
    • /
    • 2001
  • Since late 1970s. one of the principal research areas in transportation problem is dynamic traffic assignment (DTA). Although many models have been developed regarding DTA, yet they have some limits of describing real traffic patterns. This reason comes from the fact that DTA model has the time varying constraints such as state equation, flow propagation constraint, first in first out(FIFO) rule and queuing evolution. Thus, DTA model should be designed to satisfy these constraints as well as dynamic route choice condition, dynamic user equilibrium. In this respect, link-based DTA models have difficulty in satisfying such constraints because they have to satisfy the constraints for each link, while path-based DTA models may easily satisfy them. In this paper we develop a path-based DTA model. The model includes point queue theory to describe the queue evolution and simulation loading method for depicting traffic patterns in more detail. From a numerical test, the model shows promising results.

  • PDF

An Investigation on the Characteristics of Local Factors of Safety of Rock Failure and Their Dependency on the Stress Paths (암석파괴 국부안전율의 특성과 응력경로 의존성 고찰)

  • Lee, Youn-Kyou
    • Tunnel and Underground Space
    • /
    • v.27 no.1
    • /
    • pp.39-49
    • /
    • 2017
  • The factor of safety (FOS) is commonly used as an index to quantitatively state the degree of safety of various rock structures. Therefore it is important to understand the definition and characteristics of the adopted FOS because the calculated FOS may be different according to the definition of FOS even if it is estimated under the same stress condition. In this study, four local factors of safety based on maximum shear stress, maximum shear strength, stress invariants, and maximum principal stress were defined using the Mohr-Coulomb and Hoek-Brown failure criteria. Then, the variation characteristics of each FOS along five stress paths were investigated. It is shown that the local FOS based on the shear strength, which is widely used in the stability analysis of rock structures, results in a higher FOS value than those based on the maximum principal stress and the stress invariants. This result implies that the local FOS based on the maximum shear stress or the stress invariants is more necessary than the local FOS based on the shear strength when the conservative rock mechanics design is required. In addition, it is shown that the maximum principal stresses at failure may reveal a large difference depending on the stress path.

An Efficient Sequence Matching Method for XML Query Processing (XML 질의 처리를 위한 효율적인 시퀀스 매칭 기법)

  • Seo, Dong-Min;Song, Seok-Il;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.35 no.4
    • /
    • pp.356-367
    • /
    • 2008
  • As XML is gaining unqualified success in being adopted as a universal data representation and exchange format, particularly in the World Wide Web, the problem of querying XML documents poses interesting challenges to database researcher. Several structural XML query processing methods, including XISS and XR-tree, for past years, have been proposed for fast query processing. However, structural XML query processing has the problem of requiring expensive Join cost for twig path query Recently, sequence matching based XML query processing methods, including ViST and PRIX, have been proposed to solve the problem of structural XML query processing methods. Through sequence matching based XML query processing methods match structured queries against structured data as a whole without breaking down the queries into sub queries of paths or nodes and relying on join operations to combine their results. However, determining the structural relationship of ViST is incorrect because its numbering scheme is not optimized. And PRIX requires many processing time for matching LPS and NPS about XML data trees and queries. Therefore, in this paper, we propose efficient sequence matching method u sing the bottom-up query processing for efficient XML query processing. Also, to verify the superiority of our index structure, we compare our sequence matching method with ViST and PRIX in terms of query processing with linear path or twig path including wild-card('*' and '//').

Performance Evaluation of System Catalog Management Schemes for Distributed XML Repository Systems at the Query Compilation Time (분산 XML 저장 시스템에서 질의 컴파일 시 시스템 카탈로그 관리 기법의 성능 평가)

  • Jang, Gun-Up;Hong, Eui-Kyeong
    • Journal of Korea Multimedia Society
    • /
    • v.12 no.2
    • /
    • pp.178-190
    • /
    • 2009
  • XML is recommended by W3C(World Wide Web) and widely accepted as a standard markup language for expression and sharing data. Recently, increasing the use and the amount of XML documents, there is required that easy methods for accessing XML documents at anytime and anywhere, therefore, the distributed XML repository systems is developed. For this, distributed XML repository systems is necessary to research catalog management schemes. In this paper, we design distributed XML database model considering CPU costs, I/O costs, concurrency control, two-phase commits a protocol, queuing delay and so on. And we implement a simulator in order to execute performance evaluation centralized catalog method, fully replicated catalog method, and partitioned catalog method using reasonably setting up environments.

  • PDF

A Comparative Analysis of Proportional Expression and Proportional Distribution in Elementary Mathematics Textbooks (비례식과 비례배분에 대한 초등 수학 교과서 비교 분석)

  • Chang, Hyewon;Park, Haemin;Kim, Jusuk;Lim, Miin;Yu, Migyoung;Lee, Hwayoung
    • School Mathematics
    • /
    • v.19 no.2
    • /
    • pp.229-248
    • /
    • 2017
  • This study investigated the factors that should be considered when teaching proportional expression and proportional distribution through literature review. Based on these results, we analyzed and compared Korean and foreign mathematics textbooks on proportional expression and proportional distribution longitudinally and horizontally to search for desirable methods of organizing the unit of proportional expression and proportional distribution in mathematics textbooks. For longitudinal analysis, we took the mathematics textbooks according to the national curriculum since the 5th one. For horizontal analysis, we selected the mathematics textbooks of Japan, Singapore, and China. In each textbook, the contents and the order in relation to proportional expression and proportional distribution, the definitions of terminology, and the contexts and the visual representations for introducing related concepts are selected as the analysis framework. The results of analysis revealed many characteristics and the differences in ways of dealing contents about proportional expression and proportional distribution. Based on these results, we suggested some implications for writing the unit of proportional expression and proportional distribution in elementary mathematics textbooks.

Cache-Friendly Adaptive Video Streaming Framework Exploiting Regular Expression in Content Centric Networks (콘텐트 중심 네트워크에서 정규표현식을 활용한 캐시친화적인 적응형 스트리밍 프레임워크)

  • Son, Donghyun;Choi, Daejin;Choi, Nakjung;Song, Junghwan;Kwon, Ted Taekyoung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.9
    • /
    • pp.1776-1785
    • /
    • 2015
  • Content Centric Network (CCN) has been introduced as a new paradigm due to a shift of users's perspective of using Internet from host-centric to content-centric. On the other hand, a demand for video streaming has been increasing. Thus, Adaptive streaming has been introduced and researched for achieving higher user's satisfaction. If an architecture of Internet is replaced with CCN architecture, it is necessary to consider adaptive video streaming in CCN according to the demand of users. However, if the same rate decision algorithm used in Internet is deployed in CCN, there are a limitation of utilizing content store (CS) in CCN router and a problem of reflecting dynamic requirements. Therefore, this paper presents a framework adequate to CCN protocol and cache utilization, adapting content naming method of exploiting regular expression to the rate decision algorithm of the existing adaptive streaming. In addition, it also improves the quality of video streaming and verifies the performance through dynamic expression strategies and selection algorithm of the strategies.

VOQL : A Visual Object Query Language (Stochastic VOQL : 시각적 객체 질의어)

  • Kim, Jeong-Hee;Cho, Wan-Sup;Lee, Suk-Kyoon;Whang, Kyung-Young
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.38 no.5
    • /
    • pp.1-15
    • /
    • 2001
  • Expressing complex query conditions in a concise and intuitive way has been a challenge in the design of visual object-oriented query languages. We propose a visual query language called VOQL (Visual Object oriented Query Language) for object oriented databases. By employing the visual notation of graph and Venn diagram, the database schema and the advanced features of object oriented queries such as multi-valued path expressions and quantifiers can be represented in a simple way. VOQL has such good features as simple and intuitive syntax, well-defined semantics, and excellent expressive power of object-oriented queries compared with previous visual object-oriented query languages.

  • PDF

The Surrealist Expression of Buddhist Symbolism Using 3D Computer Animation (3D 애니메이션을 이용한 불교 상징성의 초현실주의적 표현)

  • Lee, Hyun-Seok
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.9
    • /
    • pp.93-101
    • /
    • 2014
  • My artwork, '1000 years', in the form of an animation film has been exhibited in the '2011 Haein Art project' of a special exhibition at the Haeinsa monastery compound. The '1000 years' represents the marvels of sacredness and Buddhist symbols using the surrealist expression of computer animation. This paper would argue how Buddhist idea can be explored by the surrealist expression of 3D computer animation. In the light of this, animation and surrealist expression will be reviewed by the epistemological approach and based on this, I would attempt to reveal how this computer animation film represents the meaning of Buddhist symbols which exist in the monastery compound. This research is processed by the case study related to my artwork as the form of art practice based research.

Analysis of Interfacial Surface Crack Perpendicular to the Surface (표면에 수직한 계면방향 표면균열의 해석)

  • 최성렬
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.17 no.2
    • /
    • pp.277-284
    • /
    • 1993
  • Interfacial surface crack perpendicular to the surface, which is imbedded into bonded quarter planes under single anti-plane shear load is analyzed. The problem is formulated using Mellin transform, form which single Wiener-Hopf equation is derived. By solving the equation stress intensity factor is obtained in closed form. This solution can be used as a Green's function to generate the solutions of other problems with the same geometry but of different loading conditions.

Efficient Construction of Over-approximated CFG on Esterel (Esterel에서 근사-제어 흐름그래프의 효율적인 생성)

  • Kim, Chul-Joo;Yun, Jeong-Han;Seo, Sun-Ae;Choe, Kwang-Moo;Han, Tai-Sook
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.11
    • /
    • pp.876-880
    • /
    • 2009
  • A control flow graph(CFG) is an essential data structure for program analyses based on graph theory or control-/data- flow analyses. Esterel is an imperative synchronous language and its synchronous parallelism makes it difficult to construct a CFG of an Esterel program. In this work, we present a method to construct over-approximated CFGs for Esterel. Our method is very intuitive and generated CFGs include not only exposed paths but also invisible ones. Though the CFGs may contain some inexecutable paths due to complex combinations of parallelism and exception handling, they are very useful for other program analyses.