Feasible Sanitary Sewer Network Generation Using Graph Theory
نویسندگان
چکیده
منابع مشابه
Layout and size optimization of sanitary sewer network using intelligent ants
The incremental solution building capability of ant algorithm is exploited in this paper for the efficient layout and pipe size optimization of sanitary sewer network. Layout and pipe size optimization of sewer networks requires that the pipe locations, pipe diameters and pipe slopes are optimally determined. This problem is a highly constrained mixed-integer nonlinear programming (MINLP) probl...
متن کاملAnalysis of the enzyme network involved in cattle milk production using graph theory
Understanding cattle metabolism and its relationship with milk products is important in bovine breeding. A systemic view could lead to consequences that will result in a better understanding of existing concepts. Topological indices and quantitative characterizations mostly result from the application of graph theory on biological data. In the present work, the enzyme network involved in cattle...
متن کاملAutomatic SPARQL Benchmark Generation using FEASIBLE
Benchmarking is indispensable when aiming to assess technologies with respect to their suitability for given tasks. In this demo, we present the interface of FEASIBLE, an automatic approach for the generation of benchmarks out of the sets of queries. The generation is achieved by selecting prototypical queries of a user-defined size from an input set of queries. In our demo, we focus on the fun...
متن کاملIdentifying network structure similarity using spectral graph theory
Most real networks are too large or they are not available for real time analysis. Therefore, in practice, decisions are made based on partial information about the ground truth network. It is of great interest to have metrics to determine if an inferred network (the partial information network) is similar to the ground truth. In this paper we develop a test for similarity between the inferred ...
متن کاملDetailed Network Measurements Using Sparse Graph Counters: The Theory
Measuring network flow sizes is important for tasks like accounting/billing, network forensics and security. Per-flow accounting is considered hard because it requires that many counters be updated at a very high speed; however, the large fast memories needed for storing the counters are prohibitively expensive. Therefore, current approaches aim to obtain approximate flow counts; that is, to de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Civil Engineering
سال: 2019
ISSN: 1687-8086,1687-8094
DOI: 10.1155/2019/8527180