Areas of outstanding natural beauty management plans - a guide

This is a summary of the guidance produced by the Countryside Agency to assist local authorities, AONB staff units, AONB partners and others concerned with the production and implementation of AONB Management Plans in England. A parallel text has been produced by the Countryside Council for Wales to cover Welsh AONBs. The aims of the guide are to: • assist local authorities and conservation boards to discharge their statutory functions with regard to the production of AONB Management Plans; • help ensure that Management Plans that are produced are appropriate to the needs of the AONB, have the commitment of all AONB partners1 and other stakeholders, are implemented, and their policy objectives achieved. The guide is has statutory force under the 2001 Countryside and Rights of Way Ac

ALTERNATIVE AUCTION INSTITUTIONS FOR ELECTRIC POWER MARKETS

Restructuring of electric power markets is proceeding across the United States and in many other nations around the world. The performance of these markets will influence everything from the prices faced by consumers to the reliability of the systems. The challenges of these changes present many important areas for research. For much of the northeastern United States, restructuring proposals include, at least for the short term, the formation of a single-sided auction mechanism for the wholesale market. This research uses experimental methods to analyze how these markets may function. In the experiments, the two basic uniform price auction rules are tested under three different market sizes. Early experimental results suggest the commonly proposed last-accepted-offer auction works well, but market power could be a real concern.Resource /Energy Economics and Policy,

On the Combinatorial Complexity of Approximating Polytopes

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error parameter $\varepsilon > 0$, the objective is to determine a polytope of minimum combinatorial complexity whose Hausdorff distance from $K$ is at most $\varepsilon \cdot \mathrm{diam}(K)$. By combinatorial complexity we mean the total number of faces of all dimensions of the polytope. A well-known result by Dudley implies that $O(1/\varepsilon^{(d-1)/2})$ facets suffice, and a dual result by Bronshteyn and Ivanov similarly bounds the number of vertices, but neither result bounds the total combinatorial complexity. We show that there exists an approximating polytope whose total combinatorial complexity is $\tilde{O}(1/\varepsilon^{(d-1)/2})$, where $\tilde{O}$ conceals a polylogarithmic factor in $1/\varepsilon$. This is a significant improvement upon the best known bound, which is roughly $O(1/\varepsilon^{d-2})$. Our result is based on a novel combination of both old and new ideas. First, we employ Macbeath regions, a classical structure from the theory of convexity. The construction of our approximating polytope employs a new stratified placement of these regions. Second, in order to analyze the combinatorial complexity of the approximating polytope, we present a tight analysis of a width-based variant of B\'{a}r\'{a}ny and Larman's economical cap covering. Finally, we use a deterministic adaptation of the witness-collector technique (developed recently by Devillers et al.) in the context of our stratified construction.Comment: In Proceedings of the 32nd International Symposium Computational Geometry (SoCG 2016) and accepted to SoCG 2016 special issue of Discrete and Computational Geometr

Industrialization, urbanization, and land use in China:

Rapid industrial development and urbanization transfer more and more land away from agricultural production, threatening China's capability to feed itself. This paper analyzes the determinants of land use by modeling arable land and sown area separately. An inverse U-shaped relationship between land use intensity and industrialization is explored both theoretically and empirically. The findings highlight the conflict between the two policy goals of industrialization and grain self-sufficiency in the end. Several policy recommendations are offered to reconcile the conflict.Industrialization., Land use., Urbanization., China.,

AN ECONOMIC ANALYSIS OF THE U.S. GENERIC DAIRY ADVERTISING PROGRAM USING AN INDUSTRY MODEL

The market impacts of generic dairy advertising are assessed using an industry model which encompasses supply and demand conditions at the retail, wholesale, and farm levels, and government intervention under the dairy price support program. The estimated model is used to simulate price and quantity values for four advertising scenarios: (1) no advertising, (2) historical fluid advertising, (3) historical manufactured advertising, and (4) historical fluid and manufactured advertising. Compared to previous studies, the dairy-industry model provides additional insights into the way generic dairy advertising influences prices and quantities at the retail, wholesale, and farm levels.Livestock Production/Industries, Marketing,

A NEW ALGORITHM FOR COMPUTING COMPENSATED INCOME FROM ORDINARY DEMAND FUNCTIONS

This paper proposes a REversible Second-ORder Taylor (RESORT) expansion of the expenditure function to compute compensated income from ordinary demand functions as an alternative to the algorithm proposed by Vartia. These algorithms provide measures of Hicksian welfare changes and Konus-type cost of living indices. RESORT also validates the results by checking the matrix of compensated price effects. obtained through the Slutsky equation, for symmetry and negative semi-definiteness as required by expenditure minimization. In contrast, Vartia's algorithm provides no validation procedure. RESORT is similar to Vartia's algorithm in using price steps. It computes compensated income at each step "forward" from the initial to the terminal prices, and insures that the compensated income computed "backward" is equal to its value computed in the "forward" procedure. Thus, RESORT is "reversible" and guarantees unique values of compensated income for each set of prices and, as a result, also unique measures of welfare changes and cost of living indices. These unique results are not, however, guaranteed by the usual Taylor series expansion for computing compensated income.Research Methods/ Statistical Methods,

Measuring Hicksian Welfare Changes From Marshallian Demand Functions

A.E. Res. 91-10A problem persists in measuring the welfare effects of simultaneous price and income changes because the Hicksian compensating variation (CV) and equivalent variation (EV), while unique, are based on unobservable (Hicksian) demand functions, and observable (Marshallian) demand functions do not necessarily yield a unique Marshallian consumer's surplus (CS). This paper proposes a solution by a Taylor series expansion of the expenditure function to approximate CV and EV by way of the Slutsky equation to transform Hicksian price effects into Marshallian price and income effects. The procedure is contrasted with McKenzie's money metric (MM) measure derived from a Taylor series expansion of the indirect utility function. MM requires a crucial assumption about the marginal utility of income to monetize changes in utility levels. No such assumption is required by the proposed procedure because the expenditure function is measured in money units. The expenditure approach can be used to approximate EV and CV while the MM is an approximation to EV. The EV and CV approximations are shown to be very accurate in numerical examples of two prices and income changing simultaneously, and are generally more accurate than MM

Implementation of linear minimum area enclosing traingle algorithm

This article has been made available through the Brunel Open Access Publishing Fund.An algorithm which computes the minimum area triangle enclosing a convex polygon in linear time already exists in the literature. The paper describing the algorithm also proves that the provided solution is optimal and a lower complexity sequential algorithm cannot exist. However, only a high-level description of the algorithm was provided, making the implementation difficult to reproduce. The present note aims to contribute to the field by providing a detailed description of the algorithm which is easy to implement and reproduce, and a benchmark comprising 10,000 variable sized, randomly generated convex polygons for illustrating the linearity of the algorithm