Acyclic Directed Graphs Based on Residue Curves for Feasibility Analysis

被引：0
|
作者：
Bonet, Jordi [1 ]
Plesu, Valentin [2 ]
Ruiz, Alexandra Elena Bonet [1 ,2 ]
Iancu, Petrica [2 ]
Llorens, Joan [1 ]
机构：
[1] Univ Barcelona, Dept Chem Engn, E-08028 Barcelona, Spain
[2] Univ Politehn Bucuresti, Ctr Technol Transfer Proc Ind, Bucharest 011061, Romania
来源：
REVISTA DE CHIMIE | 2014年 / 65卷 / 02期
关键词：
acyclic directed graph; feasibility; residue curve maps (RCMs); MAP ANALYSIS; DISTILLATION; SYSTEMS;
D O I：
暂无
中图分类号：
O6 [化学];
学科分类号：
0703 ;
摘要：
Residue curve maps (RCMs) provide a rapid and graphical way to visualize the feasibility of separation, taking into account the azeotropic constraints and boundaries. Unfortunately, due to its graphical nature, they are mainly used for azeotropic ternary systems. RCM represents the composition column profiles for distillation units operated at infinite reflux flow rate. When checking the feasibility, the present paper proposes to use acyclic directed graphs since the column profile of compositions are not so relevant compared to the singular points joined by them.
引用
收藏
页码：229 / 232
页数：4
相关论文
共 50 条
  • [31] On counting homomorphisms to directed acyclic graphs
    Dyer, Martin
    Goldberg, Leslie Ann
    Paterson, Mike
    JOURNAL OF THE ACM, 2007, 54 (06)
  • [32] Recursive processing of directed acyclic graphs
    Bianchini, M
    Gori, M
    Scarselli, F
    NEURAL NETS WIRN VIETRI-01, 2002, : 96 - 101
  • [33] Ternary directed acyclic word graphs
    Miyamoto, S
    Inenaga, S
    Takeda, M
    Shinohara, A
    IMPLEMENTATION AND APPLICATION OF AUTOMATA, PROCEEDINGS, 2003, 2759 : 120 - 130
  • [34] HEURISTIC CHAINING IN DIRECTED ACYCLIC GRAPHS
    VENUGOPAL, R
    SRIKANT, YN
    COMPUTER LANGUAGES, 1993, 19 (03): : 169 - 184
  • [35] On compact directed acyclic word graphs
    Crochemore, M
    Verin, R
    STRUCTURES IN LOGIC AND COMPUTER SCIENCE: A SELECTION OF ESSAYS IN HONOR OF A. EHRENFEUCHT, 1997, 1261 : 192 - 211
  • [36] Broadcasting on Random Directed Acyclic Graphs
    Makur, Anuran
    Mossel, Elchanan
    Polyanskiy, Yury
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (02) : 780 - 812
  • [37] Information Flow on Directed Acyclic Graphs
    Donders, Michael
    More, Sara Miner
    Naumov, Pavel
    LOGIC, LANGUAGE, INFORMATION AND COMPUTATION, WOLLIC 2011, 2011, 6642 : 95 - 109
  • [38] Community detection in directed acyclic graphs
    Leo Speidel
    Taro Takaguchi
    Naoki Masuda
    The European Physical Journal B, 2015, 88
  • [39] Covering Pairs in Directed Acyclic Graphs
    Beerenwinkel, Niko
    Beretta, Stefano
    Bonizzoni, Paola
    Dondi, Riccardo
    Pirola, Yuri
    COMPUTER JOURNAL, 2015, 58 (07): : 1673 - 1686
  • [40] On counting homomorphisms to directed acyclic graphs
    Dyer, Martin
    Goldberg, Leslie Ann
    Paterson, Mike
    AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 38 - 49
12345