Abstract It is common to formulate the history-matching problem using Bayes’ theorem. From Bayes’, conditional probability density function (pdf) of uncertain model parameters proportional prior pdf parameters, multiplied by likelihood measurements. The static are random variables characterizing reservoir while observations include, e.g., historical rates oil, gas, and water produced from wells...

‎it is well known that every (real or complex) normed linear space $l$ is isometrically embeddable into $c(x)$ for some compact hausdorff space $x$‎. ‎here $x$ is the closed unit ball of $l^*$ (the set of all continuous scalar-valued linear mappings on $l$) endowed with the weak$^*$ topology‎, ‎which is compact by the banach--alaoglu theorem‎. ‎we prove that the compact hausdorff space $x$ can ...

in this paper, we introduce the cone normed spaces and cone bounded linear mappings. among other things, we prove the baire category theorem and the banach--steinhaus theorem in cone normed spaces.

Let be the random graph with fixed p 1. A strong matching S in Gn,p is a set of {el, e2, ... I em} such that no other of the connects an end-vertex of with an end-vertex of ej, ei ej. We show in this paper, that there exist positive constants Cl and C2 such that, with probability tending to 1 as n --+ 00, the minimum size of a maximal strong in Gn,p lies between 1/21ogdn c1logd1ogdn and logdn +...

We discuss the relation between the c–theorem and the the way various symmetries are realized in quantum field theory. We review our recent proof of the c–theorem in four dimensions. Based on this proof and further evidence, we conjecture that the realization of chiral symmetry be irreversible, flowing from the Wigner-Weyl realization at short distance to the Nambu–Goldstone realization at long...

In the present paper, we study some properties of fuzzy norm of linear operators. At first the bounded inverse theorem on fuzzy normed linear spaces is investigated. Then, we prove Hahn Banach theorem, uniform boundedness theorem and closed graph theorem on fuzzy normed linear spaces. Finally the set of all compact operators on these spaces is studied.

Satisfiability Modulo Theories (SMT) solvers have proven highly scalable, efficient and suitable for integrating theory reasoning. However, for numerous applications from program analysis and verification, the ground fragment is insufficient, as proof obligations often include quantifiers. A well known approach for quantifier reasoning uses a matching algorithm that works against an E-graph to ...

We introduce and study a combinatorial problem called preference-constrained oriented matching. This problem is defined on a directed graph in which each node has preferences over its out-neighbors, and the goal is to find a maximum-size matching on this graph that satisfies a certain preference constraint. One of our main results is a structural theorem showing that if the given graph is compl...

In this paper we investigate the question whether a perfect matching can be isolated by a weighting scheme using Chinese Remainder Theorem (short: CRT). We give a systematical analysis to a method based on CRT suggested by Agrawal in a CCC’03-paper for testing perfect matchings. We show that this desired test-procedure is based on a deterministic weighting scheme which can be generalized in a n...

Dependent pattern matching is a safe and efficient way to write programs and proofs in dependently typed languages. Current languages with dependent pattern matching treat overlapping patterns on a first-match basis, hence the order of the patterns can matter. Perhaps surprisingly, this order-dependence can even occur when the patterns do not overlap. To fix this confusing behavior, we develope...