Defining Renewable Groundwater Use and Its Relevance to Sustainable Groundwater Management

Groundwater systems are commonly defined as renewable or non‐renewable based on natural fluxes of recharge or on estimates of aquifer storage and groundwater residence time. However, we show here that the principle of capture (i.e., how recharge and discharge change due to pumping) challenges simple definitions so that a groundwater system cannot be renewable or non‐renewable in and of itself, but only with reference to how the groundwater is being used. We develop and propose more hydraulically informed definitions for flux‐renewable and storage‐renewable groundwater use, and a combined definition that encompasses both the flux‐based and storage‐based perspectives such that: renewable groundwater use allows for dynamically stable re‐equilibrium of groundwater levels and quality on human timescales. Further, we show how a matrix of combinations of (a) the ratio of pumping rate to the maximum rate of capture along with (b) the response or recovery timescales implicit in this definition, leads to a useful four‐quadrant framework for characterizing groundwater use, illustrated using case studies from aquifers around the world. Renewable groundwater use may inform pathways to groundwater sustainability, which encompasses a broader set of dimensions (e.g., socio‐political, economic, ecological and cultural) beyond the scope of groundwater science. We propose that separating physically robust definitions of renewable groundwater use from the inherently value‐based language of sustainability, can help bring much needed clarity to wider discussions about sustainable groundwater management strategies, and the role of groundwater science and scientists in such endeavors

Knowledge of AIDS and HIV transmission among drug users in Rio de Janeiro, Brazil

<p>Abstract</p> <p>Background</p> <p>Proper knowledge of HIV transmission is not enough for people to adopt protective behaviors, but deficits in this information may increase HIV/AIDS vulnerability.</p> <p>Objective</p> <p>To assess drug users' knowledge of HIV/AIDS and the possible association between knowledge and HIV testing.</p> <p>Methods</p> <p>A Cross-sectional study conducted in 2006/7 with a convenience sample of 295 illicit drug users in Rio de Janeiro, assessing knowledge on AIDS/HIV transmission and its relationship with HIV testing. Information from 108 randomly selected drug users who received an educational intervention using cards illustrating situations potentially associated with HIV transmission were assessed using Multidimensional Scaling (MDS).</p> <p>Results</p> <p>Almost 40% of drug users reported having never used condoms and more than 60% reported not using condoms under the influence of substances. Most drug users (80.6%) correctly answered that condoms make sex safer, but incorrect beliefs are still common (e.g. nearly 44% believed HIV can be transmitted through saliva and 55% reported that HIV infection can be transmitted by sharing toothbrushes), with significant differences between drug users who had and who had not been tested for HIV. MDS showed queries on vaginal/anal sex and sharing syringes/needles were classified in the same set as effective modes of HIV transmission. The event that was further away from this core of properly perceived risks referred to blood donation, perceived as risky. Other items were found to be dispersed, suggesting inchoate beliefs on transmission modes.</p> <p>Conclusions</p> <p>Drug users have an increased HIV infection vulnerability compared to the general population, this specific population expressed relevant doubts about HIV transmission, as well as high levels of risky behavior. Moreover, the findings suggest that possessing inaccurate HIV/AIDS knowledge may be a barrier to timely HIV testing. Interventions should be tailored to such specific characteristics.</p

Continuous relaxation of MINLP problems by penalty functions: a practical comparison

A practical comparison of penalty functions for globally solving mixed-integer nonlinear programming (MINLP) problems is presented. The penalty approach relies on the continuous relaxation of the MINLP problem by adding a specific penalty term to the objective function. A new penalty algorithm that addresses simultaneously the reduction of the error tolerances for optimality and feasibility, as well as the reduction of the penalty parameter, is designed. Several penalty terms are tested and different penalty parameter update schemes are analyzed. The continuous nonlinear optimization problem is solved by the deterministic DIRECT optimizer. The numerical experiments show that the quality of the produced solutions are satisfactory and that the selected penalties have different performances in terms of efficiency and robustness.This work has been supported by COMPETE: POCI-01-0145-FEDER-007043 and FCT - Fundação para a Ciência e Tecnologia, within the projects UID/CEC/00319/2013 and UID/MAT/00013/2013.info:eu-repo/semantics/publishedVersio

Penalty-based heuristic direct method for constrained global optimization

This paper is concerned with an extension of the heuristic DIRECT method, presented in[8], to solve nonlinear constrained global optimization (CGO) problems. Using a penalty strategy based on a penalty auxiliary function, the CGO problem is transformed into a bound constrained problem. We have analyzed the performance of the proposed algorithm using fixed values of the penalty parameter, and we may conclude that the algorithm competes favourably with other DIRECT-type algorithms in the literature.The authors wish to thank two anonymous referees for their comments and suggestions to improve the paper. This work has been supported by FCT – Fundação para a Ciência e Tecnologia within the R&D Units Project Scope: UIDB/00319/2020, UIDB/00013/2020 and UIDP/00013/2020 of CMAT-UM

Theoretical and practical convergence of a self-adaptive penalty algorithm for constrained global optimization

This paper proposes a self-adaptive penalty function and presents a penalty-based algorithm for solving nonsmooth and nonconvex constrained optimization problems. We prove that the general constrained optimization problem is equivalent to a bound constrained problem in the sense that they have the same global solutions. The global minimizer of the penalty function subject to a set of bound constraints may be obtained by a population-based meta-heuristic. Further, a hybrid self-adaptive penalty firefly algorithm, with a local intensification search, is designed, and its convergence analysis is established. The numerical experiments and a comparison with other penalty-based approaches show the effectiveness of the new self-adaptive penalty algorithm in solving constrained global optimization problems.The authors would like to thank the referees, the Associate Editor and the Editor-in-Chief for their valuable comments and suggestions to improve the paper. This work has been supported by COMPETE: POCI-01-0145-FEDER-007043 and FCT - Funda¸c˜ao para a Ciˆencia e Tecnologia within the projects UID/CEC/00319/2013 and UID/MAT/00013/2013.info:eu-repo/semantics/publishedVersio