Tight bounds and conjectures for the isolation lemma

Given a hypergraph $H$ and a weight function $w: V \rightarrow \{1, \dots, M\}$ on its vertices, we say that $w$ is isolating if there is exactly one edge of minimum weight $w(e) = \sum_{i \in e} w(i)$. The Isolation Lemma is a combinatorial principle introduced in Mulmuley et. al (1987) which gives a lower bound on the number of isolating weight functions. Mulmuley used this as the basis of a parallel algorithm for finding perfect graph matchings. It has a number of other applications to parallel algorithms and to reductions of general search problems to unique search problems (in which there are one or zero solutions). The original bound given by Mulmuley et al. was recently improved by Ta-Shma (2015). In this paper, we show improved lower bounds on the number of isolating weight functions, and we conjecture that the extremal case is when $H$ consists of $n$ singleton edges. When $M \gg n$ our improved bound matches this extremal case asymptotically. We are able to show that this conjecture holds in a number of special cases: when $H$ is a linear hypergraph or is 1-degenerate, or when $M = 2$. We also show that it holds asymptotically when $M \gg n \gg 1$

Edge-coloring linear hypergraphs with medium-sized edges

Motivated by the Erd\H{o}s-Faber-Lov\'{a}sz (EFL) conjecture for hypergraphs, we consider the list edge coloring of linear hypergraphs. We show that if the hyper-edge sizes are bounded between $i$ and $C_{i,\epsilon} \sqrt{n}$ inclusive, then there is a list edge coloring using $(1 + \epsilon) \frac{n}{i - 1}$ colors. The dependence on $n$ in the upper bound is optimal (up to the value of $C_{i,\epsilon}$)

Impact Fees in Pennsylvania

This article focuses on impact fees as authorized by Pennsylvania law. It examines legislatively authorized impact fees under the municipalities planning code and, through examination of Pennsylvania case law, addresses the question of whether impact fees may be impliedly authorized pursuant to the police power or other planning and zoning powers of the municipality. Finally, the article analyzes the standard a municipality must meet in order to justify the charging of transportation impact fees under the recently-enacted transportation impact fee legislation, and compares the standard to a more rigorous one employed by a handful of other states

BIOMASS FOR ELECTRICITY AND PROCESS HEAT AT ETHANOL PLANTS

Published in: Applied Engineering in Agriculture, Vol. 22(5): 723-728Biomass, Process heat, Ethanol production, Electricity, Combined heat and power, Resource /Energy Economics and Policy,

ECONOMICS OF BIOMASS GASIFICATION/COMBUSTION AT FUEL ETHANOL PLANTS

Published in Applied Engineering in Agriculture, Vol. 25(3): 391‐400Ethanol, Biomass, Economics, CHP, Emissions, Process heat, Electricity production, Resource /Energy Economics and Policy,

INTEGRATING BIOMASS TO PRODUCE HEAT AND POWER AT ETHANOL PLANTS

Published in: Applied Engineering in Agriculture, Vol. 25(2): 227‐244Biomass, Renewable, Sustainable, Model, Gasification, Combustion, Emissions, Ethanol production, Combined heat and power, Resource /Energy Economics and Policy,

Nest site selection patterns of dabbling ducks in response to variation in predation pressure : an experimental study

Nesting success is an important vital rate affecting the reproductive fitness of birds, and predation typically is the single most important factor affecting nesting success. Presumably, birds should nest in locations that maximize nest survival. If specific nest characteristics increase the probability that a nest will hatch, natural (phenotypic) selection could favour use of sites with these features, producing nonrandom patterns of nest site use. Alternatively, birds that are highly selective in nest site choices might be at a disadvantage if predators learn to forage preferentially in these locations and improve their efficiency in depredating nests; in this case, random nesting patterns could be favoured. Finally, it has been hypothesized that predation pressure can influence nest site selection patterns of entire bird communities. If predators develop a search image to hunt for bird nests, then nests that are most similar to each other, irrespective of species, should sustain higher mortality. To evaluate these hypotheses, I quantified nest site selection patterns of multiple species of ground-nesting dabbling ducks in areas where predation pressure was normally high, and compared these patterns to those on areas where predation was relaxed. Predation pressure was experimentally reduced by removing common predators of duck nests and females (mainly red foxes, coyotes, skunks and raccoons) on some study areas and not on others (controls). Predator removal and natural causes produced a 10-fold difference in duck nesting across study sites, allowing for investigation of effects of predation pressure on nest site selection of ducks. Coarse scale habitat selection patterns were similar to results reported in previous studies; blue-winged teal and northern shoveler were found more often in native grassland than in other habitat types, while gadwall and mallard nests occurred more frequently in shrub patches when compared with other habitat patches. A difference in nest site characteristics was observed between hatched and depredated nests for gadwall and northern shoveler but not for blue-winged teal and mallard. However, in all species, the nest site selection patterns were non-random. Thus, the process of nest predation did not shape patterns of nest site choice. Contrary to predictions, inter-specific overlap in nest site features was not related to predation pressure: nests that overlapped most with features of other species did not suffer higher predation, nor did inter-specific overlap in nest characteristics decrease during the nesting season. These findings were inconsistent with the hypothesis that community-level patterns of nest site use are differentiated as a result of predation pressure. Long-term work on nest site use by individually marked females of numerous ground-nesting bird species would be informative, as would experimental studies of other hypotheses about factors affecting nest site choices in birds

A Corn Stover Supply Logistics System

Published in Applied Engineering in Agriculture, Vol. 26(3): 455‐461, 2010. American Society of Agricultural and Biological EngineersCorn stover, Economics, GHG emission, Logistics, Roll press compaction, Tub grinding, Agribusiness, Crop Production/Industries,

Comparisons of Carbon Pools and Economic Profitability for Managed Ponderosa Pine Stands in Wyoming, USA

A forest carbon (C) sequestration project was conducted to evaluate the economic incentives that would be required by landowners to engage in C trading under different management regimes. Costs associated with joint management for C sequestration and timber would be valuable for establishing sound forest C trading systems. In this study, we calculated the C yield and amortized value of three Wyoming, ponderosa pine stands. The management practices examined were, unmanaged, even-aged (regene-ration after clear-cut) and uneven-aged (selectively harvested). Costs and revenues associated with three stands were converted into 2006 real dollars using the all commodity producer price index to facilitate a comparison among the net revenues of three stands. Net revenues were annualized using a conservative annual interest rate of 4.5%. Our even-aged stand had the highest annual average C yield of 2.48 Mg·ha-1·a-1, whereas, the uneven-aged stand had the lowest C accumulation (1.98 Mg·ha-1·a-1). Alternatively, the even-aged stand had the highest amortized net return of $276·ha-1·a-1 and the unmanaged stand had the lowest net return of$64 ha-1a-1. On the plots examined, an annual payment of $22 for each additional Mg of C sequestered would encourage a change from uneven aged management to an unmanaged stand that sequesters additional C, in the absence of transactions costs

Bounds and algorithms for graph trusses

The $k$-truss, introduced by Cohen (2005), is a graph where every edge is incident to at least $k$ triangles. This is a relaxation of the clique. It has proved to be a useful tool in identifying cohesive subnetworks in a variety of real-world graphs. Despite its simplicity and its utility, the combinatorial and algorithmic aspects of trusses have not been thoroughly explored. We provide nearly-tight bounds on the edge counts of $k$-trusses. We also give two improved algorithms for finding trusses in large-scale graphs. First, we present a simplified and faster algorithm, based on approach discussed in Wang & Cheng (2012). Second, we present a theoretical algorithm based on fast matrix multiplication; this converts a triangle-generation algorithm of Bjorklund et al. (2014) into a dynamic data structure