Centralized and decentralized management of groundwater with multiple users

In this work, we investigate two groundwater inventory management schemes with multiple users in a dynamic game-theoretic structure: (i) under the centralized management scheme, users are allowed to pump water from a common aquifer with the supervision of a social planner, and (ii) under the decentralized management scheme, each user is allowed to pump water from a common aquifer making usage decisions individually in a non-cooperative fashion. This work is motivated by the work of Saak and Peterson [14], which considers a model with two identical users sharing a common aquifer over a two-period planning horizon. In our work, the model and results of Saak and Peterson [14] are generalized in several directions. We first build on and extend their work to the case of n non-identical users distributed over a common aquifer region. Furthermore, we consider two different geometric configurations overlying the aquifer, namely, the strip and the ring configurations. In each configuration, general analytical results of the optimal groundwater usage are obtained and numerical examples are discussed for both centralized and decentralized problems.     

Playing with models and optimization to overcome the tragedy of the commons in groundwater

Groundwater is the natural resource most extracted in the world. It supplies 50% of the total potable water requirements, 40% of the industry take, and 20% of agriculture groundwater is a strategic resource for every country. That common‐pool resources are highly susceptible to lead to a tragedy of the commons is a well‐known fact. We claim that a combination of groundwater modeling, optimization, and a game theoretical analysis may in fact avoid the tragedy. A groundwater model in MODFLOW from Zamora aquifer in Mexico was used as input of a basic but instructive, optimization problem: extract the greatest possible volume of water, but at the same time minimizing the drawdown and drawdown velocity. The solutions of the optimization problem were used to construct the payoffs of a hypothetical game among the aquifer users, the resource's administrator, and a resource protector entity. We show that the success of the optimal management program depends heavily on the information that the users have about the resource. Therefore, better decision‐making processes are a consequence of sustainability literacy. Particularly, water literacy could lead to the usage of water considering it as a part of an ecosystem and not only as a natural resource. Additionally, a new non‐classical equation for underground flow was derived, that may be specially important to understand and predict the groundwater flow in highly heterogeneous conditions as in karstic aquifers or fractured media. © 2013 Wiley Periodicals, Inc. Complexity 19: 9–21, 2013     

Environmental flow requirements for integrated water resources allocation in the Yellow River Basin,China

Based on the classification and regionalization of the ecosystem, multiple ecological management objectives and the spatial variability of the environmental flow requirements of the Yellow River Basin were analyzed in this study. The summation rule was used to calculate water consumption requirements and the compatibility rule, i.e., “maximum” principle, was also adopted to estimate the non-consumptive use of water in the river basin. The environmental flow requirements for integrated water resources allocation were determined by identifying the natural and artificial water consumption in the Yellow River Basin. The results indicated that the annual minimum environmental flow requirements amounted to 317.62 × 10⁸ m³, which represented 54.76% of the natural river flows, while for the environmental flow requirements for the integrated water resources allocation were 262.47 × 10⁸ m³, which represented 45.25% of the natural river flows. The highest percentage of environmental flow requirements was 93.64% for the river ecosystem. It can be concluded that the primary concerns should be put on the downstream river water requirements to determine the environmental flows for integrated water resources allocation in a river basin.     

On the complexity of a class of combinatorial optimization problems with uncertainty

We consider a robust (minmax-regret) version of the problem of selecting p elements of minimum total weight out of a set of m elements with uncertainty in weights of the elements. We present a polynomial algorithm with the order of complexity O((min {p,m-p})² m) for the case where uncertainty is represented by means of interval estimates for the weights. We show that the problem is NP-hard in the case of an arbitrary finite set of possible scenarios, even if there are only two possible scenarios. This is the first known example of a robust combinatorial optimization problem that is NP-hard in the case of scenario-represented uncertainty but is polynomially solvable in the case of the interval representation of uncertainty. Received: July 1998 / Accepted: May 2000?Published online March 22, 2001     

Hydrogeochemical modeling for groundwater management in arid and semiarid regions using MODFLOW and MT3DMS: A case study of the Jeffara of Medenine coastal aquifer,South-Eastern Tunisia

The study of water quality and the quantification of reserves and their variations according to natural and anthropogenic forcing is necessary to establish an adequate management plan for groundwater resources. For this purpose, a modeling approach is a useful tool that allows, after calibration phase and verification of simulation, and under different scenarios of forcing and operational changes, to estimate and control the groundwater quantity and quality. The main objective of this study is to collect all available data in a model that simulates the Jeffara of Medenine coastal aquifer system functioning. To achieve this goal, a conceptual model was constructed based on previous studies and hydrogeological investigations. The regional groundwater numerical flow model for the Jeffara aquifer was developed using MODFLOW working under steady-state and transient conditions. Groundwater elevations measured from the piezometric wells distributed throughout the study area in 1973 were selected as the target water levels for steady state (head) model calibration. A transient simulation was undertaken for the 42 years from 1973 to 2015. The historical transient model calibration was satisfactory, consistent with the continuous piezometric decline in response to the increase in groundwater abstraction. The developed numerical model was used to study the system's behavior over the next 35 years under various constraints. Two scenarios for potential groundwater extraction for the period 2015–2050 are presented. The predictive simulations show the effect of the increase of the exploitation on the piezometric levels. To study the phenomenon of salinization, which is one of the most severe and widespread groundwater contamination problems, especially in coastal regions, a solute transport model has been constructed by using MT3DMS software coupled with the groundwater flow model. The best calibration results are obtained when the connection with the overlying superficial aquifer is considered suggesting that groundwater contamination originates from this aquifer. Recommendations for water resource managers

• The results of this study show that Groundwater resources of Jeffara of Medenine coastal aquifer in Tunisia are under immense pressure from multiple stresses.
• The water resources manager must consider the impact of economic and demographic development in groundwater management to avoid the intrusion of saline water.
• The results obtained presented some reference information that can serve as a basis for water resources planning.
• The model runs to provide information that managers can use to regulate and adequately control the Jeffara of Medenine water resources.

     

Freshwater inflow requirements for the protection of the critical habitat and the drinking water sources in the Yangtze River Estuary,China

Freshwater inflow requirements (FIRs for short), which considered the requirements for protection of drinking water sources as well as the first-grade state protection wildlife (Acipenser sinensis) in larval periods, were analyzed in this paper for the Yangtze River Estuary, China. Based on the different levels of salinity objectives and the relationship between salinity and the freshwater inflows, the FIRs for the Yangtze River Estuary were determined. The estuary FIRs were determined based on the habitat ecosystem health from April to November with minimum and medium levels, from March to December with high level; and on the requirement of protection of drinking water sources in other months of the year, accordingly. Combined the salinity objectives of drinking water sources and critical habitat in the Yangtze River Estuary, the FIRs for the estuary are calculated to be 938.2 × 10⁹, 729.4 × 10⁹ and 615.5 × 10⁹ m³ in the whole year with different levels, which is equal to 100.8%, 78.4% and 66.2% of the average annual river discharge for the Yangtze River Estuary, respectively. Annual river discharges can satisfy the medium and minimum levels of FIRs for the estuary. However, the temporal variation of the actual runoff has distinct difference from the FIRs for the estuary in critical periods (May, July and August) for the habitat ecosystem, 5% of the FIRs for the estuary should be maintained from December to February for protection of drinking water sources.     

Decremental Dynamic Connectivity

We consider Las Vegas randomized dynamic algorithms for on-line connectivity problems with deletions only. In particular, we show that starting from a graph with m edges and n nodes, we can maintain a spanning forest during m deletions in O(m log(n²/m) + n(log n)³(log log n)²) expected time, which is O(m) if m = Θ(n²) and O(m log n) if m = Ω(n(log n log log n)²). The deletions may be interspersed with connectivity queries, each of which is answered in constant time. The previous best bound was O(m log² n) by Henzinger and Thorup which covered both insertions and deletions. The result is based on a general randomized reduction for edge connectivity problems of many deletions-only queries to a few deletions and insertions queries. For 2-edge connectivity, the complexity is improved from O(m(log n)⁵) to O(m log(n²/m) + n(log n)⁶(log log n)²). For the general decremental k-edge-connectivity problem, we get a total running time of O(k²n² polylog n). Here the previous best bound was O(kmn polylog n). Improved running times are also achieved for the static consensus tree problem, with applications to computational biology and relational data bases.     

Exact special solitary solutions with compact support for the nonlinear dispersive K(m, n) equations

The nonlinear dispersive K(m, n) equations, u_t−(u^m)_x−(uⁿ)_xxx = 0 which exhibit compactons: solitons with compact support, are studied. New exact solitary solutions with compact support are found. The two special cases, K(2, 2) and K(3, 3), are chosen to illustrate the concrete features of the decomposition method in K(m, n) equations. General formulas for the solutions of K(m, n) equations are established.     

New exact solitary-wave special solutions for the nonlinear dispersive K(m, n) equations

In this paper, we study the nonlinear dispersive K(m, n) equations: u_t + (u^m)_x − (uⁿ)_xxx = 0 which exhibit solutions with solitary patterns. New exact solitary solutions are found. The two special cases, K(2, 2) and K(3, 3), are chosen to illustrate the concrete features of the decomposition method in K(m, n) equations. The nonlinear equations K(m, n) are studied for two different cases, namely when m = n being odd and even integers. General formulas for the solutions of K(m, n) equations are established.     

Functional inequalities related to Mahler’s conjecture

Extending a result of Meyer and Reisner (Monatsh Math 125:219–227, 1998), we prove that if g: \mathbbR? \mathbbR₊{g: \mathbb{R}\to \mathbb{R}_+} is a function which is concave on its support, then for every m > 0 and every z ? \mathbbR{z\in\mathbb{R}} such that g(z) > 0, one has

On cyclic codes of length $${2^{2^r}-1}$$ with two zeros whose dual codes have three weights

In 1976, Helleseth conjectured that two binary m-sequences of length 2 ^m − 1 can not have a three-valued crosscorrelation function when m is a power of 2. We show that this conjecture is true when −1 is a correlation value. In other words, if C_1,k{{\mathcal{C}}_{1,k}} is the cyclic code of length 2 ^m − 1 with two zeros α, α ^k , where α is a primitive element of \mathbbF_2^m{{\mathbb{F}}_{2^m}} and gcd(k, 2 ^m − 1) = 1, then its dual C_1,k^{^}{{\mathcal{C}}_{1,k}^{\perp}} can not have three weights when m is a power of 2.     

Classification of solutions to the higher order Liouville’s equation on {\mathbb{R}^{2m}}

We classify the solutions to the equation (−Δ) ^m u = (2m − 1)!e ^2mu on giving rise to a metric with finite total Q-curvature in terms of analytic and geometric properties. The analytic conditions involve the growth rate of u and the asymptotic behaviour of Δu at infinity. As a consequence we give a geometric characterization in terms of the scalar curvature of the metric at infinity, and we observe that the pull-back of this metric to S ^2m via the stereographic projection can be extended to a smooth Riemannian metric if and only if it is round.     

Homogeneous Schr?dinger Operators on Half-Line

The differential expression L_m=-?_x²+(m²-1/4)x^-2{L_m=-\partial_x^2+(m^2-1/4)x^{-2}} defines a self-adjoint operator H _m on L ²(0, ∞) in a natural way when m ² ≥ 1. We study the dependence of H _m on the parameter m show that it has a unique holomorphic extension to the half-plane Re m > −1, and analyze spectral and scattering properties of this family of operators.     

de Sitter空间S1m+1中具有平行Blaschke张量的正则类空超曲面

本文引入两个以de Sitter空间为模型的非齐性坐标来覆盖共形空间Q₁^m+1.利用球面S^m+1中超曲面的Möbius几何的方法,本文研究了Q₁^m+1中正则类空超曲面的共形几何.作为其结果,本文对所有具有平行Blaschke张量的正则类空超曲面进行了完全分类.     

Parallel Construction and Query of Index Data Structures for Pattern Matching on Square Matrices

We describe fast parallel algorithms for building index data structures that can be used to gather various statistics on square matrices. The main data structure is the Lsuffix tree, which is a generalization of the classical suffix tree for strings. Given ann×ntext matrixA, we build our data structures inO(log n) time withn²processors on a CRCW PRAM, so that we can quickly processAin parallel as follows: (i) report some statistical information aboutA, e.g., find the largest repeated square submatrices that appear at least twice inAor determine, for each position inA, the smallest submatrix that occurs only there; (ii) given, on-line, anm×mpattern matrixPAT, check whether it occurs inA. We refer to the above two kinds of operations as queries and point out that they have applications to visual databases and two-dimensional data compression. Query (i) takesO(log n) time withn²/log nprocessors and query (ii) takesO(log m) time withm²/log mprocessors. The query algorithms are work optimal while the construction algorithm is work optimal only for arbitrary and large alphabets.     

Evaluating impacts of fish stock enhancement and biodiversity conservation actions on the livelihoods of small‐scale fishers on the Beijiang River,China

Inappropriate development and overexploitation have seriously degraded aquatic resources in China. Stakeholders identified three fish stock enhancement and biodiversity conservation scenarios for the Beijiang River: S1, increased fish restocking; S2, no fishing season and habitat conservation; and S3, strict pollution control. Potential impacts of these actions on the livelihoods of fishers were evaluated using applied economic modeling. Baseline costs and benefits came from logbooks from 30 fishers and a survey of 90 households in three villages. The financial net benefit for a household was US$1583 (￥11,160) annually, representing a 142% and 387% return on capital and operating costs, respectively. Larger catches associated with S1 and S2 generated a net benefit of US$1651 and US$1822, respectively. Strict pollution control resulting in higher catches (+20%) and lower operating costs (?20%) would increase the net benefit by 15.9% to US$1835 annually. Pollution control would benefit other resource users and is a prerequisite for ecological restoration. Recommendations for Resource Managers

• Stringent pollution control measures are essential to conserve aquatic biodiversity and enhance the livelihoods of fishers but will require considerable public and private sector investment.
• Enhanced fish stocks in the Beijiang River could benefit poor livelihoods but may not be sufficient to lift households out of poverty, aged fishers require government assistance to diversify their livelihoods, access alternative urban employment, and survive with dignity.
• Adopting the economic modeling approach presented here could enable responsible authorities to simultaneously evaluate fish stock enhancement and biodiversity conservation options.
• Broader application of the approach presented here could help ensure small‐scale inland fisheries are managed sustainably and aquatic ecosystems are restored and protected by 2020, in line with Target 6 of the United Nations’ Convention on Biological Diversity Strategic Plan for Biodiversity.

     

On the Chromaticity of Multi-Bridge Hypergraphs

A multi-bridge hypergraph is an h-uniform linear hypergraph consisting of some linear paths having common extremities. In this paper it is proved that the multisets of path lengths of two chromatically equivalent multi-bridge hypergraphs are equal provided the multiplicities of path lengths are bounded above by 2 ^h-1 − 2. Also, it is shown that h-uniform linear cycles of length m are not chromatically unique for every m, h ≥ 3.     

Density of smooth maps in Wk, p(M, N) for a close to critical domain dimension

Assuming m − 1 < kp < m, we prove that the space C ^∞(M, N) of smooth mappings between compact Riemannian manifolds M, N (m = dim M) is dense in the Sobolev space W ^k,p (M, N) if and only if π _m−1(N) = {0}. If π _m−1(N) ≠ {0}, then every mapping in W ^k,p (M, N) can still be approximated by mappings M → N which are smooth except in finitely many points.     

Resolvable Mendelsohn triple systems with equal sized holes

An HMTS of type {n₁, n₂, ⋖, n_h} is a directed graph which can be decomposed into 3-circuits. If the 3-circuits can be partitioned into parallel classes, then the HMTS is called an RHMTS. In this article it is shown that the RHMTSs of type m^h exist when mh &equiv 0 (mod 3) and (m, h) &ne (1, 6), with the possible exception of h = 6 and , where M₁₇ = {m|m is divisible by a prime less than 17}. The existence of Mendelsohn frames, which is closely related to RHMTS, is also considered in this article. It is proved that a Mendelsohn frame of type t^u exists if and only if u ≥ 4 and t(u - 1) ≡ 0(mod 3) with 2 possible exceptions. © 1997 John Wiley & Sons, Inc. J Combin Designs 5:329–340, 1997     

Fractional dynamics of systems with long-range interaction

We consider one-dimensional chain of coupled linear and nonlinear oscillators with long-range powerwise interaction defined by a term proportional to 1/∣n − m∣^α+1. Continuous medium equation for this system can be obtained in the so-called infrared limit when the wave number tends to zero. We construct a transform operator that maps the system of large number of ordinary differential equations of motion of the particles into a partial differential equation with the Riesz fractional derivative of order α, when 0 < α < 2. Few models of coupled oscillators are considered and their synchronized states and localized structures are discussed in details. Particularly, we discuss some solutions of time-dependent fractional Ginzburg–Landau (or nonlinear Schrodinger) equation.