Loading...
Search for: tree-decomposition
0.011 seconds

    Quad-Tree decomposition method for areal upscaling of heterogeneous reservoirs: Application to arbitrary shaped reservoirs

    , Article Fuel ; Volume 139 , 2014 , Pages 659-670 ; 00162361 (ISSN) Gholinezhad, S ; Jamshidi, S ; Hajizadeh, A ; Sharif University of Technology
    Abstract
    In this paper, Quad-Tree decomposition method is applied for areal upscaling of irregular shaped petroleum reservoirs. Quad-Tree decomposition is a recursive data structuring technique which generates an upscaled model with non-uniform (unstructured) gridblocks. This type of coarsening reduces the number of gridblocks, but preserves the main heterogeneity features of the original fine model. Because of the quadruplet nature of the Quad-Tree decomposition, this method cannot be used for upscaling of irregular-shaped models, directly. In this study, by circumscribing a square to the irregular-shaped reservoirs, a temporary model is obtained which can be upscaled by Quad-Tree decomposition.... 

    Simulation of 2-Phase Fluid Flow on Unstructured Grids Upscaled by Image Segmentation Methods

    , M.Sc. Thesis Sharif University of Technology Gholinezhad, Sajjad (Author) ; Jamshidi, Saeed (Supervisor) ; Hajizadeh, Alireza (Co-Advisor)
    Abstract
    This paper describes the use of Quad-Tree Decomposition for upscaling of absolute permeability 2D geological models. Quad-Tree Decomposition is a data structure and generates an unstructured upscaled model that preserves the heterogeneity of the original geological model. In other words, in high-variability regions of the geological model, the gridblocks of the upscaled model remain small but in other regions that the permeability variation is low, the gridblocks of the upscaled model are coarsened. Quad-Tree Decomposition is a very simple, efficient and robust method that reduces the total number of gridblocks and results to high saving in time and memory required to flow simulation in the... 

    Releasing All-Pairs Shortest Distances of Public Graphs with Differential Privacy

    , M.Sc. Thesis Sharif University of Technology Tofighi Mohammadi, Alireza (Author) ; Ebrahimi Boroojeni, Javad (Supervisor)
    Abstract
    In the context of differential privacy, a data holder has confidential information about users. The goal is to provide a randomized algorithm that takes this information as input and outputs an aggregation of the input. The algorithm must have the property that for any neighboring input pairs, the output distribution of the algorithm is close. One problem in differential privacy research is the release of shortest distances in a weighted graph. This model, first studied by Adam Sealfon, involves an edge-weighted graph G=(V, E) with weights w : E → R, where the topology of the graph is public and the private information is the weight of the edges. The aim is to provide an (ϵ, δ)-DP algorithm... 

    Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth

    , Article 18th International Symposium on Automated Technology for Verification and Analysis, ATVA 2020, 19 October 2020 through 23 October 2020 ; Volume 12302 LNCS , 2020 , Pages 253-270 Asadi, A ; Chatterjee, K ; Kafshdar Goharshady, A ; Mohammadi, K ; Pavlogiannis, A ; Sharif University of Technology
    Springer Science and Business Media Deutschland GmbH  2020
    Abstract
    Discrete-time Markov Chains (MCs) and Markov Decision Processes (MDPs) are two standard formalisms in system analysis. Their main associated quantitative objectives are hitting probabilities, discounted sum, and mean payoff. Although there are many techniques for computing these objectives in general MCs/MDPs, they have not been thoroughly studied in terms of parameterized algorithms, particularly when treewidth is used as the parameter. This is in sharp contrast to qualitative objectives for MCs, MDPs and graph games, for which treewidth-based algorithms yield significant complexity improvements. In this work, we show that treewidth can also be used to obtain faster algorithms for the...