Tight Gas in the Netherlands A Study Proposal EBN Exploration Day - PowerPoint PPT Presentation

Sep 08, 2022 •669 likes •726 views

Tight Gas in the Netherlands A Study Proposal EBN Exploration Day 23 May 2016 1 1 Why a Tight Gas Study Proposal The Netherlands contains circa 50 discoveries with about 100 200 bcm undevelopped gas in tight reservoirs Several

Tight Gas in the Netherlands A Study Proposal EBN Exploration Day 23 May 2016 1 1
Why a Tight Gas Study Proposal • The Netherlands contains circa 50 discoveries with about 100 – 200 bcm undevelopped gas in tight reservoirs • Several successful and unsuccessful tight gas appraisal/developments have taken place • Infrastructure is aging • Time is running out for tight gas field appraisal / development • EBN study demonstrates good commercial opportunities with tight gas stimulation 2 2 EBN Schulte, Lutgert en Asschert, 2012
Tight Gas Study Proposal • PanTerra proposes to categorize and map offshore tight gas discoveries and fields in Rotliegend and Bunter reservoirs • PanTerra is in a unique position for 2910 plugs < 1mD this study because of its: – database and experience with core studies – geological knowledge of the Netherlands – experienced G&G and reservoir PanTerra database, NLOG data engineering department – access to stimulation and other experts 3 3
Tight Gas Study Proposal • Categorize and describe offshore tight gas discoveries in Rotliegend and Bunter reservoirs • Collect, study and integrate: – Core descriptions (Depositional system, facies, diagenesis) – Core experiments (mineral and clay content, porosity, permeability, capillary pressure, electrical properties a,m,n) • Define burial history (literature, wells and seismic) • Petrophysical consistent log evaluation • Identify tight rock classes • Integrate SCAL data for a hydraulic rock-typing approach – pore throat radius – relative permeability measurements: What is “mobile gas”? • Collect, evaluate and integrate well test, stimulation and production data and correlate them with the rock types defined above. • Describe common tight gas factors and differences – Can sweet-spots be identified – Recommend which stimulation techniques work best – Define best practice to calculate production forecasts and recovery 4 4
None Propriatary Study • Estimated start: Summer 2016 • Duration: About one year • Workscope: to be framed with sponsors • PanTerra seeks sponsors for this project • Cost estimate: Pending study framework 5 5

Recommend

SVMpAUC-tight: A new algorithm for optimizing partial AUC based on a tight convex upper bound

SVMpAUC-tight: A new algorithm for optimizing partial AUC based on a tight convex upper bound Harikrishna Narasimhan and Shivani Agarwal Department of Computer Science and Automation Indian Institute of Science, Bangalore Receiver Operating

1.12k views • 90 slides

Chapter 2 Tight-frames An Introduction 1 Outline 1. Tight-frame 1. Tight-frame 2. Matrix

Chapter 2 Tight-frames An Introduction 1 Outline 1. Tight-frame 1. Tight-frame 2. Matrix Representation 2. Matrix Representation 2 1 Tight Frames 3 Construction of Haar Wavelet = + 4 2 Construction of Haar Wavelet 5 Construction

450 views • 16 slides

Tight sets in finite geometry Jan De Beule Department of Mathematics Ghent University March

history polar spaces and srgs definitions/properties i -tight sets vs. m -ovoids CL line classes other results references Tight sets in finite geometry Jan De Beule Department of Mathematics Ghent University March 19th, 2015 ALCOMA 15,

1.51k views • 67 slides

General Remarks 1 Finite Classical Polar Spaces 2 m -ovoids and x -tight sets 3

Outline General Remarks Finite Classical Polar Spaces m -ovoids and x -tight sets Cameron-Liebler line classes m -Ovoids of Q (4 Tight Sets and m -Ovoids of Quadrics 1 Qing Xiang Department of Mathematical Sciences University of Delaware

814 views • 40 slides

On the Impossibility of Tight Cryptographic Reduc:ons Christoph Bader, Tibor Jager, Yong Li, Sven

On the Impossibility of Tight Cryptographic Reduc:ons Christoph Bader, Tibor Jager, Yong Li, Sven Schge Ruhr-University Bochum EUROCRYPT 2016 1 Tight Cryptographic Reduc:ons 1. Define a security model 2. Prove: efficient a/acker A

835 views • 48 slides

Tight PRF-Security of Double-block Hash-then-Sum MACs Seongkwang Kim, Byeonghak Lee , Jooyoung Lee

Tight PRF-Security of Double-block Hash-then-Sum MACs Seongkwang Kim, Byeonghak Lee , Jooyoung Lee KAIST Outline Introduction - Message Authentication Code - Double-block Hash-then-Sum paradigm Our Contribution - Tight security proof of

394 views • 24 slides

Lattices from equiangular tight frames Lenny Fukshansky Claremont McKenna College (joint work

Lattice notation Equiangular frame lattices Other tight frames Conclusion Lattices from equiangular tight frames Lenny Fukshansky Claremont McKenna College (joint work with Albrecht B ottcher, Stephan Garcia, Hiren Maharaj, Deanna

837 views • 61 slides

HIBE with Tight Multi-challenge Security Roman Langrehr ETH Zurich (Switzerland), Part of the

HIBE with Tight Multi-challenge Security Roman Langrehr ETH Zurich (Switzerland), Part of the work done at KIT (Karlsruhe, Germany) Jiaxin Pan NTNU (Trondheim, Norway) Roman Langrehr, Jiaxin Pan 2020-06-01 1 Outline (H)IBE Tight

997 views • 67 slides

Keeping the ATO at Bay When Times are Tight Presented by Martin McCoy OVE VERVIEW In this

Keeping the ATO at Bay when times are tight Martin McCoy Who should you trust? Ryan & Durey Keeping the ATO at Bay When Times are Tight Presented by Martin McCoy OVE VERVIEW In this presentation, I will talk about: The

307 views • 9 slides

Nearly Tight Bounds for Robust Proper Learning of Halfspaces with a Margin Ilias Diakonikolas

Nearly Tight Bounds for Robust Proper Learning of Halfspaces with a Margin Ilias Diakonikolas Daniel M. Kane Pasin Manurangsi UW Madison UC San Diego Google Nearly Tight Bound for Robust Proper Learning of Halfspaces with a Margin

345 views • 32 slides

Quadratically Tight Relations for Randomized Query Complexity Rahul Jain Hartmut Klauck Srijita

Quadratically Tight Relations for Randomized Query Complexity Quadratically Tight Relations for Randomized Query Complexity Rahul Jain Hartmut Klauck Srijita Kundu Troy Lee Miklos Santha Swagato Sanyal Jevg enijs Vihrovs Centre for

550 views • 26 slides

S2S ASR Advanced issues Tight coupling Tight coupling ASR should output N ASR should

S2S ASR Advanced issues Tight coupling Tight coupling ASR should output N ASR should output N- -best best Translated all (lattice) Translated all (lattice) Choose best translation Choose best translation

425 views • 21 slides

On i -tight sets of the Hermitian polar space with small parameter i Jan De Beule Vrije

On i -tight sets of the Hermitian polar space with small parameter i Jan De Beule Vrije Universiteit Brussel jan@debeule.eu GAC workshop P ecs 2016 Jan De Beule (VUB) i -tight sets of Hermitian polar spaces P ecs 2016 1 / 15 Finite

498 views • 20 slides

What is this talk about? What is this talk about? Deriving tight and safe task execution time

What is this talk about? What is this talk about? Deriving tight and safe task execution time bounds in a flexible and easy way independently of the system complexity... What is this talk about? Deriving tight and safe task execution time

551 views • 34 slides

New York City Apartments # Bed bug calls 14000 12768 12000 10985 9213 10000 8000 8000

Bed Bugs: What Residents Should Know? Department of Entomology Rutgers University Good night, sleep tight, and Richard Cooper and Changlu Wang dont let the bed bugs bite. 1999: limited mostly to hotels Good night, sleep tight and

445 views • 8 slides

Tight Bounds for Cost-Sharing in Weighted Congestion Games Martin Gairing University of

Tight Bounds for Cost-Sharing in Weighted Congestion Games Martin Gairing University of Liverpool Joint work with: Konstantinos Kollias (Stanford University) Grammateia Kotsialou (University of Liverpool) Gairing, Kollias, Kotsialou Tight

335 views • 32 slides

Constructing Equiangular Tight Frames with Alternating Projection Joel A. Tropp

Constructing Equiangular Tight Frames with Alternating Projection Joel A. Tropp <jtropp@ices.utexas.edu> Institute for Computational Engineering and Sciences The University of Texas at Austin Inderjit S. Dhillon and Robert W. Heath,

803 views • 22 slides

Tight-Binding Reduction for Continuum IQHE Models Jacob Shapiro (ongoing project with Michael I.

Tight-Binding Reduction for Continuum IQHE Models Jacob Shapiro (ongoing project with Michael I. Weinstein) Venice 2019 - Quantissima in the Serenissima III August 22, 2019 J. Shapiro (Columbia U.) Tight-Binding Reduction for the IQHE August

628 views • 46 slides

From Feedback Capacity to Tight Achievable Rates without Feedback for AGN Channels with Stable and

From Feedback Capacity to Tight Achievable Rates without Feedback for AGN Channels with Stable and Unstable Autoregressive Noise Christos Kourtellaris, Charalambos D. Charalambous and Sergey Loyka ISIT 2020 1 Introduction: Objectives &

766 views • 27 slides

PTRC U.S. Collaboration on EOR and Tight Oil Research Dan MacLean CEO, President Petroleum

PTRC U.S. Collaboration on EOR and Tight Oil Research Dan MacLean CEO, President Petroleum Technology Research Centre May 23, 2018 Williston Basin Petroleum Conference, Bismarck North Dakota 1 P ETROLEUM T ECHNOLOGY R ESEARCH C ENTRE

572 views • 21 slides

Proving tight security for RabinWilliams signatures D. J. Bernstein University of Illinois at

Proving tight security for RabinWilliams signatures D. J. Bernstein University of Illinois at Chicago Thanks to: NSF CCR9983950 NSF DMS0140542 NSF ITR0716498 Alfred P. Sloan Foundation Warning: Springer mangled the

589 views • 19 slides

Challenges STRATEGY FOR THE PROVISION OF School Capital Programme is very tight and SCHOOL

6/18/2014 Challenges STRATEGY FOR THE PROVISION OF School Capital Programme is very tight and SCHOOL PLACES Lancashires share can be affected by significant demand in some areas of the country PRIMARY SCHOOL PLACE REQUIREMENTS

491 views • 3 slides

Masking Proofs are Tight (and How to Exploit it in Security Evaluations) Vincent Grosso,

Masking Proofs are Tight (and How to Exploit it in Security Evaluations) Vincent Grosso, Franois-Xavier Standaert Radbout University Nijmegen (The Netherlands), UCL (Belgium) EUROCRYPT 2018, Tel Aviv, Israel Motivation (side-channel security

775 views • 52 slides

Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive

Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity Ehsan Kazemi 1 , Marko Mitrovic 1 , Morteza Zadimoghaddam 2 , Silvio Lattanzi 2 , Amin Karbasi 1 1 Yale University and 2 Google Streaming

547 views • 18 slides