نتایج جستجو برای: porosity log these pseudo

تعداد نتایج: 3182424  

2010
Sarjinder Singh Jong-Min Kim

In this paper, we propose an empirical log-likelihood estimator for estimating the population mean of a sensitive variable in the presence of an auxiliary variable. A new concept of conditional mean squared error of the empirical likelihood estimator is introduced. The proposed method is valid for simple random and without replacement sampling (SRSWOR) and could easily be extended for complex s...

The classification of well-log responses into separate flow units for generating local permeability models is often used to predict the spatial distribution of permeability in heterogeneous reservoirs. The present research can be divided into two parts; first, the nuclear magnetic resonance (NMR) log parameters are employed for developing a relationship between relaxation time and reservoir poro...

2000
Rosario Gennaro

Under the assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number, we construct a new and improved pseudo-random bit generator. This new generator outputs n− c− 1 bits per exponentiation with a c-bit exponent. Using typical parameters, n = 1024 and c = 160, this yields roughly 860 pseudo-random bits per small exponent...

2008
CÉDRIC HERZET Cédric Herzet

In this paper, we formalize and study the properties of a new kind of iterative estimation algorithm which has recently appeared in the literature in e.g. [1, 2, 3]. We refer to this algorithm as the ”iterative pseudo log-MAP function maximization (IPLFM) algorithm. We give a definition of the pseudo log-MAP function (PLF) in terms of regions of a factor graph and prove some of its properties. ...

2014
Adnan A. Abed Samir N. AL-Jawad

Permeability and capillary pressures are important petrophysical properties. Permeability is one of the most important parameters for reservoir management and development. Capillary pressure data have been widely used in evaluating reservoir rock, sealing capacity, transition zone thickness, pay versus non pay, and absolute and relative permeability. We are working in this study modification tw...

Journal: :Journal of Petroleum Exploration and Production Technology 2023

Abstract Carbonate reservoirs in Iran are the most important and main sources of oil gas production. Hydrocarbon flow rates from carbonate heavily rely on development natural fractures. This study focuses role fractures reservoir quality considering Sarvak (southwest Iran) as second Iran. To identify small-scale around borehole walls, cores description image logs were utilized. Due to high cost...

Journal: :SIAM J. Comput. 1981
Martin H. Ellis J. Michael Steele

An algorithm is given which makes only $O(\log n)$ comparisons, and which will determine the ordering of the uniformly distributed (pseudo random) Weyl sequences given by $\{ (k\alpha )\bmod 1:1 \leqq k \leqq n\} $, where $\alpha $ is an unspecified irrational number. This result is shown to be best possible in the sense that no algorithm can perform the same task with fewer than $ \Omega (\log...

2003
Juliana M. Tebo

Introduction And Geologic Overview The Upper Jurassic (Oxfordian) Smackover Formation is a stratigraphically complex carbonate formation, and a major producer of hydrocarbons in the northeastern Gulf of Mexico (Baria et al., 1982; Salvador, 1991). The main reservoir facies in the Smackover Formation are the microbial reefs, which were formed in a gently sloping to distally steepened carbonate r...

2012
Szilvia Sebők Szilágyi János Geiger

The paper presents a 3D sedimentological characterization of a delta plain reservoir. The analysis started with detailed core description studies focusing on the genetic interpretations of the sedimentary structures and multivariate statistical analyses (including Q-mode cluster and R-mode factor analysis), of the sporadic grain-size distributions. These results made the depositional processes ...

1996
Dimitris Fotakis Paul G. Spirakis

The aim of this paper is to present a proof of the equivalence of the equalities N P = PCP(log log n; 1) and P = N P. The proof is based on producing long pseudo-random bit strings through random walks on expander graphs. This technique also implies that for any language in N P there exists a restricted veriier using log n + c, c is a constant, random bits. Furthermore, we prove that the equali...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید