Filters








16,602 Hits in 5.1 sec

History matching with an ensemble Kalman filter and discrete cosine parameterization

Behnam Jafarpour, Dennis B. McLaughlin
2008 Computational Geosciences  
This paper demonstrates the use of a novel parameterization approach, the discrete cosine transform, for history matching with a recently introduced sequential estimation technique, i.e., the ensemble  ...  History matching of large hydrocarbon reservoirs is challenging because of several reasons including: (1) scarcity of available measurements relative to the number of unknowns, leading to an ill-posed  ...  However, it is also possible to formulate the history-matching problem as a state estimation problem.  ... 
doi:10.1007/s10596-008-9080-3 fatcat:bvfkr4doz5gtth6stxjffwsouy

An Improved Parameter Dimensionality Reduction Approach Based on a Fast Marching Method for Automatic History Matching

Hairong Zhang, Yongde Gao, Wei Li, Deng Liu, Jing Cao, Luoyi Huang, Xun Zhong
2022 Fluid Dynamics & Materials Processing  
History matching is a critical step in reservoir numerical simulation algorithms.  ...  Second, a mathematical model for history matching is implemented using a Bayesian framework. Third, an effective decomposition strategy is adopted for parameter dimensionality reduction.  ...  This paper presented a two-step history matching method by integrating the FMM and the PCA. The brief calculation scheme of history matching is shown in Fig. 1 .  ... 
doi:10.32604/fdmp.2022.019446 fatcat:ednnaf4tqzdnnnsdljsu2vns5q

History Matching Under Geological Control: Application to a North Sea Reservoir [chapter]

B. Todd Hoffman, Jef Caers
2005 Quantitative Geology and Geostatistics  
This limits the applications of such approaches to practical problems like history matching.  ...  The problem of determining reservoir properties, such as porosity and permeability from flow data, shortly termed "history matching", is one example.  ...  We also want to acknowledge the Stanford Center for Reservoir Forecasting for their financial support of the research.  ... 
doi:10.1007/978-1-4020-3610-1_111 fatcat:eywuc3f5hjcvfjudvu2iul5idy

A new approach with multiple realizations for image perturbation using co-simulation and probability perturbation method

Gonçalo Soares Oliveira, Célio Maschio, Denis José Schiozer
2018 Oil & Gas Science and Technology  
History matching is an inverse problem with multiple possible answers. The petrophysical properties of a reservoir are highly uncertain because data points are scarce and widely scattered.  ...  Instead of using a single image as the reference, a set of best images is used to increase variability in the properties of the reservoir model while matching production data with history data.  ...  (CEPETRO-UNICAMP) particularly the UNISIM research group, the Department of Energy of the School of Mechanical Engineering of the University of Campinas (DE-FEM-UNICAMP), the Foundation CMG and National  ... 
doi:10.2516/ogst/2018065 fatcat:nwmm3xyttjfgfii4ncsyqldyky

Parameterized Dynamic Cluster Editing

Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier, Michael Wagner
2018 Foundations of Software Technology and Theoretical Computer Science  
We introduce a dynamic version of the NP-hard Cluster Editing problem.  ...  We obtain both fixed-parameter tractability as well as parameterized hardness results, thus (except for two open questions) providing a fairly complete picture of the parameterized computational complexity  ...  Preliminaries and Problems Variants In this section we give a brief overview on concepts and notation of graph theory and parameterized complexity theory that are used in this paper.  ... 
doi:10.4230/lipics.fsttcs.2018.46 dblp:conf/fsttcs/LuoMNN18 fatcat:orl6v37o3ngdjh5haidoklv5g4

A Simple Proof of the Quadratic Formula [article]

Po-Shen Loh
2019 arXiv   pre-print
This article provides a simple proof of the quadratic formula, which also produces an efficient and natural method for solving general quadratic equations.  ...  equation ax 2 +bx+c = 0 by a (assume nonzero) to obtain an equivalent equation which matches the form of (1): x 2 + b a x + c a = 0.  ...  Heath's translation [15] of Diophantus [9] from around 250 A.D. clearly shows the solution of the core problem of finding two numbers with given sum and product (Book I Problem 27), using the key parameterization  ... 
arXiv:1910.06709v2 fatcat:eme6ixzbrncnhpp5cyfrgeltpu

Learning with Sparse and Biased Feedback for Personal Search

Michael Bendersky, Xuanhui Wang, Marc Najork, Donald Metzler
2018 Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence  
Implicit user feedback provides a convenient source of supervision for ranking models in personal search.  ...  We demonstrate how these drawbacks can be overcome, and empirically demonstrate the benefits of learning with implicit feedback in the context of a large-scale email search engine.  ...  Then, in Section 3, we provide a brief overview of empirical evaluation of our methods in the context of a large-scale email search engine. We conclude the paper in Section 4.  ... 
doi:10.24963/ijcai.2018/725 dblp:conf/ijcai/BenderskyWNM18 fatcat:rnycli44nrawfao2ivfg3rcrja

Automated Stellar Spectral Classification and Parameterization for the Masses [article]

Ted von Hippel, Carlos Allende Prieto, Chris Sneden
2002 arXiv   pre-print
In order to extend the use of automated techniques beyond a few surveys, we present our current efforts at building a web-based automated stellar spectroscopic classification and parameterization machine  ...  Stellar spectroscopic classification has been successfully automated by a number of groups.  ...  We gratefully acknowledge major financial support for this work from the State of Texas Advanced Research Program.  ... 
arXiv:astro-ph/0208185v1 fatcat:kvk3msvspreldbtbhfzvhrkq6q

Kernelization – Preprocessing with a Guarantee [chapter]

Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh
2012 Lecture Notes in Computer Science  
The framework of parameterized complexity turns out to be particularly suitable for a mathematical analysis of pre-processing heuristics.  ...  A kernelization algorithm is a preprocessing algorithm which simplifies the instances given as input in polynomial time, and the extent of simplification desired is quantified with the help of the additional  ...  Informal Description of the Method. We give a brief description of the probabilistic method with respect to a given problem Π parameterized above a tight lower bound or below a tight upper bound.  ... 
doi:10.1007/978-3-642-30891-8_10 fatcat:ihw5qxdnffdybk4f2c4lhds3pe

Review of Field Development Optimization of Waterflooding, EOR, and Well Placement Focusing on History Matching and Optimization Algorithms

2017 Processes  
This paper presents a review of history matching and oil field development optimization techniques with a focus on optimization algorithms.  ...  History matching algorithms are reviewed as a precursor to production optimization algorithms.  ...  The authors would like to acknowledge the helpful guidance from Hugh Hales, founder of IRSRI, and several others who have contributed to the review.  ... 
doi:10.3390/pr5030034 fatcat:bs3mr2oqhjfgdiqdanyqqvv6ea

Hamiltonicity below Dirac's condition [article]

Bart M.P. Jansen, László Kozma, Jesper Nederlof
2019 arXiv   pre-print
The results extend the range of tractability of the Hamiltonian cycle problem, showing that it is fixed-parameter tractable when parameterized below a natural bound.  ...  In addition, for the first parameterization we show that a kernel with O(k) vertices can be found in polynomial time.  ...  Acknowledgement We thank Naomi Nishimura, Ian Goulden, and Wendy Rush for obtaining a copy of Bondy's  ... 
arXiv:1902.01745v1 fatcat:uh57dh2zcfhatibtkjyl3xz4wq

Parameterized Dynamic Cluster Editing [article]

Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2018 arXiv   pre-print
We introduce a dynamic version of the NP-hard graph problem Cluster Editing.  ...  We obtain both fixed-parameter tractability as well as (parameterized) hardness results, thus (except for three open questions) providing a fairly complete picture of the parameterized computational complexity  ...  Preliminaries and Problems Variants In this section we give a brief overview on concepts and notation of graph theory and parameterized complexity theory that are used in this paper.  ... 
arXiv:1810.06625v2 fatcat:lquysl3qx5djppf5v4674dlr2i

Parameterized Dynamic Cluster Editing

Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier
2020 Algorithmica  
We introduce a dynamic version of the NP-hard graph modification problem Cluster editing.  ...  We obtain both fixed-parameter tractability as well as (parameterized) hardness results, thus (except for three open questions) providing a fairly complete picture of the parameterized computational complexity  ...  This yields the following list of studied problems: • Parameterized Complexity We use standard notation and terminology from parameterized complexity [15, 18, 22, 39] and give here a brief overview  ... 
doi:10.1007/s00453-020-00746-y fatcat:twhfim6bmrdjrjnahilw5goyfa

4D seismic history matching

Dean S. Oliver, Kristian Fossum, Tuhin Bhakta, Ivar Sandø, Geir Nævdal, Rolf Johan Lorentzen
2021 Journal of Petroleum Science and Engineering  
In this paper, we review the literature on 4D seismic history matching (SHM), focusing discussions on the aspects of the problem that make it more difficult than the more traditional production history  ...  Applications to field cases appear to have been at least partially successful, although quantitative assessment of the history matches and the improvements in forecast is difficult.  ...  Parameterization A suitable parameterization of the poorly known properties of the subsurface is key for obtaining a good history match.  ... 
doi:10.1016/j.petrol.2021.109119 fatcat:3u5jqmor6vbf5jup2dks76lsge

General Parameterized Thermal Modeling for High-Performance Microprocessor Design

Thom J. Eguia, Sheldon X.-D. Tan, Ruijing Shen, Duo Li, Eduardo H. Pacheco, Murli Tirumala, Lingli Wang
2012 IEEE Transactions on Very Large Scale Integration (vlsi) Systems  
Experimental results on a practical quad-core microprocessor show that the generated parameterized thermal model matches the given data very well.  ...  To overcome the overfitting problems of the subspace method, the new method employs an overfitting mitigation technique to improve model accuracy and predictive ability.  ...  PACKAGE-LEVEL PARAMETERIZED THERMAL MODELING PROBLEM Our modeling problem requires building parameterized thermal models considering both time and other variable parameters of multi-core processors.  ... 
doi:10.1109/tvlsi.2010.2098054 fatcat:5cile25h75eohd5qmw6pxa4oo4
« Previous Showing results 1 — 15 out of 16,602 results