Key problems and solutions in supercritical CO2 fracturing technology

Supercritical CO2 fracturing is considered to be a new method for efficient exploitation of unconventional reservoirs,such as shale gas,coal bed methane,and tight sand stone gas.Supercritical CO2 has many special properties including low viscosity,high diffusion coefficient,and lack of surface tension,which brings about great advantages for fracturing.However,these properties also cause several problems,such as difficulty in proppant transportation,high friction loss,and high pump displacement.In this paper,the above problems were analyzed by combining field test with laboratory study and specific solutions to these problems are given.The high frictionloss in the pipeline could be reduced by developing a new drag reducing agent and selecting large-size casing.Besides,for the problem of poor capacity in proppant carrying and sand plug,the methods of adding tackifier into supercritical CO2,increasing pump displacement and selecting ultralow density proppants are proposed.Moreover,for the problem of fast leak-off and high requirement for pump displacement,the displacement can be increased or the pad fluid can be injected into the reservoir.After solving the above three problems,the field test of supercritical CO2 fracturing can be conducted.The research results can promote the industrialization process of supercritical CO2 fracturing.

Test sequencing problem arising at the design stage for reducing life cycle cost

Previous test sequencing algorithms only consider the execution cost of a test at the application stage. Due to the fact that the placement cost of some tests at the design stage is considerably high compared with the execution cost, the sequential diagnosis strategy obtained by previous methods is actually not optimal from the view of life cycle. In this paper, the test sequencing problem based on life cycle cost is presented. It is formulated as an optimization problem, which is non-deterministic polynomial-time hard （NP-hard）. An algorithm and a strategy to improve its computational efficiency are proposed. The formulation and algorithms are tested on various simulated systems and comparisons are made with the extant test sequencing methods. Application on a pump rotational speed control （PRSC） system of a spacecraft is studied in detail. Both the simulation results and the real-world case application results suggest that the solution proposed in this paper can significantly reduce the life cycle cost of a sequential fault diagnosis strategy.

On the Solution Accuracy Downstream of Shocks When Using Godunov-Type Schemes.I.Sources of Errors in One-Dimensional Problems

The article opens a series of publications devoted to a systematic study of numerical errors behind the shock wave when using high-order Godunov-type schemes,including in combination with the artificial viscosity approach.The proposed paper describes the numerical methods used in the study,and identifies the main factors affecting the accuracy of the solution for the case of one-dimensional gas dynamic problems.The physical interpretation of the identified factors is given and their influence on the grid convergence is analyzed.

Projection-based High-dimensional Sign Test

This article is concerned with the high-dimensional location testing problem.For highdimensional settings,traditional multivariate-sign-based tests perform poorly or become infeasible since their Type I error rates are far away from nominal levels.Several modifications have been proposed to address this challenging issue and shown to perform well.However,most of modified sign-based tests abandon all the correlation information,and this results in power loss in certain cases.We propose a projection weighted sign test to utilize the correlation information.Under mild conditions,we derive the optimal direction and weights with which the proposed projection test possesses asymptotically and locally best power under alternatives.Benefiting from using the sample-splitting idea for estimating the optimal direction,the proposed test is able to retain type-I error rates pretty well with asymptotic distributions,while it can be also highly competitive in terms of robustness.Its advantage relative to existing methods is demonstrated in numerical simulations and a real data example.

A GENERATOR AND A SIMPLEX SOLVER FOR NETWORK PIECEWISE LINEAR PROGRAMS

This is a brief report on our recent work in network piecewise linear programming (NPLP),and it consists of two parts. In the first park, we describe a generator for NPLP problems which is derived from the classical network linear program generator NETGEN. The generator creates networks of the same topological structures as NETGEN, but each arc is associated with a convex piecewise linear cost. The purpose of this program is to provide a set of standard test problems which can be used to compare the performance of various algorithms for NPLP. In the second part,we introduce a network simplex method that directly solves a network piecewise linear program without reformulating it as a network linear program of higher dimension. Forty benchmark NPLP problems are solved by this method and a reformulation method. The computational results are in favor of the direct method and show that solving an NPLP problem is not much harder than solving a network linear program of the same dimension.