• Title/Summary/Keyword: Directed relation graph

Search Result 9, Processing Time 0.017 seconds

Reliability Evaluation of Electrical Distribution Network Containing Distributed Generation Using Directed-Relation-Graph

  • Yang, He-Jun;Xie, Kai-Gui;Wai, Rong-Jong;Li, Chun-Yan
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.4
    • /
    • pp.1188-1195
    • /
    • 2014
  • This paper presents an analytical technique for reliability evaluation of electrical distribution network (EDN) containing distributed generation (DG). Based on hierarchical levels of circuit breaker controlling zones and feeder sections, a directed-relation-graph (DRG) for an END is formed to describe the hierarchical structure of the EDN. The reliability indices of EDN and load points can be evaluated directly using the formed DRG, and the reliability evaluation of an EDN containing DGs can also be done without re-forming the DRG. The proposed technique incorporates multi-state models of photovoltaic and diesel generations, as well as weather factors. The IEEE-RBTS Bus 6 EDN is used to validate the proposed technique; and a practical campus EDN containing DG was also analyzed using the proposed technique.

Skeletal Chemical Mechanisms for a Diesel Fuel Surrogate by the Directed Relation Graph(DRG) (직접 관계 그래프(DRG)를 이용한 디젤 연료의 상세 화학 반응 기구 축소화)

  • Lee, Young-J.;Huh, Kang-Y.
    • Journal of the Korean Society of Combustion
    • /
    • v.16 no.2
    • /
    • pp.16-22
    • /
    • 2011
  • It is a challenging task to apply large detailed chemical mechanisms of fuel oxidation in simulation of complex combustion phenomena. There exist a few systematic methodologies to reduce detailed chemical mechanisms to smaller sizes involving less computational load. This research work concerns generation of a skeletal chemical mechanism by a directed relation graph with specified accuracy requirement. Two sequential stages for mechanism reduction are followed in a perfectly stirred reactor(PSR) for high temperature chemistry and to consider the autoignition delay time for low and high temperature chemistry. Reduction was performed for the detailed chemical mechanism of n-heptane consisting of 561 species and 2539 elementary reaction steps. Validation results show acceptable agreement for the autoignition delay time and the PSR calculation in wide parametric ranges of pressure, temperature and equivalence ratio.

A Study on the Automatic Synthesis of Signed Directed Graph Using Knowledge-based Approach and Loop Verification (지식 기반 접근법과 Loop 검증을 이용한 부호운향그래프 자동합성에 관한 연구)

  • Lee Sung-gun;An Dae-Myung;Hwang Kyu Suk
    • Journal of the Korean Institute of Gas
    • /
    • v.2 no.1
    • /
    • pp.53-58
    • /
    • 1998
  • By knowledge-based approach, the SDG(Signed Directed Graph) is automatically synthesized, which is commonly used to represent the causal effects between process variables. Automatic synthesis of SDG is progressed by two steps : (1)inference step uses knowledge base and (2)verification step uses Loop-Verifier. First, Topology and Knowledge Base are constructed by using the information on equipment. And then, Primary-SDG is synthesized by Character Pattern Matching between Variable-Relation-Representation generated by using Topology and Variable-Tendency-Data contained in Knowledge Base. Finally, a modified SDG is made after the Primary-SDG is verified by Loop-Verifier.

  • PDF

A Proposal of the Directed Product Graph and Its Applications to Network Analysis (I) (방향성 적선도의 제안과 회로망 해석에의 응용 (I))

  • 전선미;김수중
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.21 no.2
    • /
    • pp.19-23
    • /
    • 1984
  • A new directed product graph(DPG) is proposed from the product graph for electrical networks. By introducing the direction of an dege and the concept of a loop to product graph, it is more easy and rapid to obtain topologically the denominator of Mason's formula without relation of the sign rule and without arising terms cancelled. Also the constraints of tree selection at a given network-graph can be removed.

  • PDF

Chemical Mechanism Reduction and Validation of Methyl Butanoate by Automatic Reduction Procedure (Methyl Butanoate의 상세 화학 반응 메커니즘 자동 축소화를 통한 기초 반응 메커니즘의 생성 및 검증)

  • Lee, Youngjae;Huh, Kang Y.
    • Journal of the Korean Society of Combustion
    • /
    • v.21 no.3
    • /
    • pp.16-23
    • /
    • 2016
  • In this study, skeletal mechanisms are produced by directed relation graph with specified threshold value and sensitivity analysis based on species database from the directed relation graph. Skeletal mechanism is optimized through the elimination of unimportant reaction steps by computational singular perturbation importance index. Reduction is performed for the detailed mechanism of methyl butanoate consisting of 264 species and 1219 elementary reactions. Validation shows acceptable agreement for auto-ignition delays in wide parametric ranges of pressure, temperature and equivalence ratio. Methyl butanoate has been proposed as a simple biodiesel surrogate although the alkyl chain consists of four carbon atoms. The resulting surrogate mechanism for n-heptane and MB consists of 76 species and 226 reaction steps including those for NOx.

CBAbench: An AutoCAD-based Dynamic Geometric Constraint System

  • Gong, Xiong;Wang, Bo-Xing;Chen, Li-Ping
    • International Journal of CAD/CAM
    • /
    • v.6 no.1
    • /
    • pp.173-181
    • /
    • 2006
  • In this paper, an integration framework of Geometric Constraint Solving Engine and AutoCAD is presented, and a dynamic geometric constraint system is introduced. According to inherent orientation features of geometric entities and various Object Snap results of AutoCAD, the' proposed system can automatically construct an under-constrained geometric constraint model during interactive drawing. And then the directed constraint graph in a geometric constraint model is realtime modified in order to produce an optimal constraint solving sequence. Due to the open object-oriented characteristics of AutoCAD, a set of user-defined entities including basic geometric elements and graphics constraint relations are defined through derivation. And the custom-made Object Reactor and Command Reactor are also constructed. Several powerful characteristics are achieved based on these user-defined entities and reactors, including synchronously processing geometric constraint information while saving and opening DWG files, visual constraint relations, and full adaptability to Undo/Redo operations. These characteristics of the proposed system can help the designers more easily manage geometric entities and constraint relations between them.

Query-based Answer Extraction using Korean Dependency Parsing (의존 구문 분석을 이용한 질의 기반 정답 추출)

  • Lee, Dokyoung;Kim, Mintae;Kim, Wooju
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.3
    • /
    • pp.161-177
    • /
    • 2019
  • In this paper, we study the performance improvement of the answer extraction in Question-Answering system by using sentence dependency parsing result. The Question-Answering (QA) system consists of query analysis, which is a method of analyzing the user's query, and answer extraction, which is a method to extract appropriate answers in the document. And various studies have been conducted on two methods. In order to improve the performance of answer extraction, it is necessary to accurately reflect the grammatical information of sentences. In Korean, because word order structure is free and omission of sentence components is frequent, dependency parsing is a good way to analyze Korean syntax. Therefore, in this study, we improved the performance of the answer extraction by adding the features generated by dependency parsing analysis to the inputs of the answer extraction model (Bidirectional LSTM-CRF). The process of generating the dependency graph embedding consists of the steps of generating the dependency graph from the dependency parsing result and learning the embedding of the graph. In this study, we compared the performance of the answer extraction model when inputting basic word features generated without the dependency parsing and the performance of the model when inputting the addition of the Eojeol tag feature and dependency graph embedding feature. Since dependency parsing is performed on a basic unit of an Eojeol, which is a component of sentences separated by a space, the tag information of the Eojeol can be obtained as a result of the dependency parsing. The Eojeol tag feature means the tag information of the Eojeol. The process of generating the dependency graph embedding consists of the steps of generating the dependency graph from the dependency parsing result and learning the embedding of the graph. From the dependency parsing result, a graph is generated from the Eojeol to the node, the dependency between the Eojeol to the edge, and the Eojeol tag to the node label. In this process, an undirected graph is generated or a directed graph is generated according to whether or not the dependency relation direction is considered. To obtain the embedding of the graph, we used Graph2Vec, which is a method of finding the embedding of the graph by the subgraphs constituting a graph. We can specify the maximum path length between nodes in the process of finding subgraphs of a graph. If the maximum path length between nodes is 1, graph embedding is generated only by direct dependency between Eojeol, and graph embedding is generated including indirect dependencies as the maximum path length between nodes becomes larger. In the experiment, the maximum path length between nodes is adjusted differently from 1 to 3 depending on whether direction of dependency is considered or not, and the performance of answer extraction is measured. Experimental results show that both Eojeol tag feature and dependency graph embedding feature improve the performance of answer extraction. In particular, considering the direction of the dependency relation and extracting the dependency graph generated with the maximum path length of 1 in the subgraph extraction process in Graph2Vec as the input of the model, the highest answer extraction performance was shown. As a result of these experiments, we concluded that it is better to take into account the direction of dependence and to consider only the direct connection rather than the indirect dependence between the words. The significance of this study is as follows. First, we improved the performance of answer extraction by adding features using dependency parsing results, taking into account the characteristics of Korean, which is free of word order structure and omission of sentence components. Second, we generated feature of dependency parsing result by learning - based graph embedding method without defining the pattern of dependency between Eojeol. Future research directions are as follows. In this study, the features generated as a result of the dependency parsing are applied only to the answer extraction model in order to grasp the meaning. However, in the future, if the performance is confirmed by applying the features to various natural language processing models such as sentiment analysis or name entity recognition, the validity of the features can be verified more accurately.

An Analysis of the Casual Relations on Construction Project Manager's level Competency (건설 현장 관리자 역량의 인과관계 구조 분석)

  • Kim, Do-Yeob;Kim, Hwa-Rang;Jang, Hyoun-Seung
    • Journal of the Architectural Institute of Korea Structure & Construction
    • /
    • v.34 no.3
    • /
    • pp.77-86
    • /
    • 2018
  • Recently, Korean construction industry is moving from quantitative growth to qualitative growth. Among the changes in the construction industry, the competency of the project manager who represents the construction project as well as the construction company has been referred to as a factor that effects qualitative growth. This research utilized previous research analysis and expert interview in order to extract essential competency factors of a construction project manager. DEMATEL method was utilized to analyze the quantitative and objective causal relationship between the competency factors. The causal relationship of the competency factors were visualized through Digraph (directed graph) and competency areas of the project manager that requires strengthening were also suggested. Analysis result showed that the important competency categories of a project manager were Internal & External Communication, Project Management Body of Knowledge, and Inspirational Leadership. The analysis results of this research can be utilized in developing competency enhancement method for future project managers and as a basic data in developing an education program.

A Study on the Intelligent Service Selection Reasoning for Enhanced User Satisfaction : Appliance to Cloud Computing Service (사용자 만족도 향상을 위한 지능형 서비스 선정 방안에 관한 연구 : 클라우드 컴퓨팅 서비스에의 적용)

  • Shin, Dong Cheon
    • Journal of Intelligence and Information Systems
    • /
    • v.18 no.3
    • /
    • pp.35-51
    • /
    • 2012
  • Cloud computing is internet-based computing where computing resources are offered over the Internet as scalable and on-demand services. In particular, in case a number of various cloud services emerge in accordance with development of internet and mobile technology, to select and provide services with which service users satisfy is one of the important issues. Most of previous works show the limitation in the degree of user satisfaction because they are based on so called concept similarity in relation to user requirements or are lack of versatility of user preferences. This paper presents cloud service selection reasoning which can be applied to the general cloud service environments including a variety of computing resource services, not limited to web services. In relation to the service environments, there are two kinds of services: atomic service and composite service. An atomic service consists of service attributes which represent the characteristics of service such as functionality, performance, or specification. A composite service can be created by composition of atomic services and other composite services. Therefore, a composite service inherits attributes of component services. On the other hand, the main participants in providing with cloud services are service users, service suppliers, and service operators. Service suppliers can register services autonomously or in accordance with the strategic collaboration with service operators. Service users submit request queries including service name and requirements to the service management system. The service management system consists of a query processor for processing user queries, a registration manager for service registration, and a selection engine for service selection reasoning. In order to enhance the degree of user satisfaction, our reasoning stands on basis of the degree of conformance to user requirements of service attributes in terms of functionality, performance, and specification of service attributes, instead of concept similarity as in ontology-based reasoning. For this we introduce so called a service attribute graph (SAG) which is generated by considering the inclusion relationship among instances of a service attribute from several perspectives like functionality, performance, and specification. Hence, SAG is a directed graph which shows the inclusion relationships among attribute instances. Since the degree of conformance is very close to the inclusion relationship, we can say the acceptability of services depends on the closeness of inclusion relationship among corresponding attribute instances. That is, the high closeness implies the high acceptability because the degree of closeness reflects the degree of conformance among attributes instances. The degree of closeness is proportional to the path length between two vertex in SAG. The shorter path length means more close inclusion relationship than longer path length, which implies the higher degree of conformance. In addition to acceptability, in this paper, other user preferences such as priority for attributes and mandatary options are reflected for the variety of user requirements. Furthermore, to consider various types of attribute like character, number, and boolean also helps to support the variety of user requirements. Finally, according to service value to price cloud services are rated and recommended to users. One of the significances of this paper is the first try to present a graph-based selection reasoning unlike other works, while considering various user preferences in relation with service attributes.