The Effects of Hydropeaking on Lotic Benthic Macroinvertebrate Assemblages

The term hydropeaking refers to anthropogenically induced, short-duration, high-magnitude discharge pulses that are generated in lotic systems for electricity production. The practice of hydropeaking produces the largest source of renewable energy worldwide, and its use is projected to increase through the year 2040. The primary objective of this work was to evaluate the effects of hydropeaking on benthic macroinvertebrate assemblages, which are important components of lotic ecosystems. Results of this work show that, across a wide range of impacted systems worldwide, the consistently observed patterns of elevated benthic macroinvertebrate drift in response to hydropeaking pulses are primarily related to the rate at which discharge is increased (i.e., ramping rate) and secondarily to the time between pulses. In addition, it was shown that taxa inhabiting depositional habitat patches (i.e. fine substrates and slow water velocities) were most susceptible to peaking-induced drift, and that these taxa were also those most prevalent in hydropeaking-impacted systems. Collectively, these results suggest that increased pulse ramping rate and the resulting elevated macroinvertebrate drift may be positive selective forces, which benefit populations adapted for life in hydropeaking-impacted lotic ecosystems. These results provide a greater understanding of the factors that are most important for governing the effects of hydropeaking on benthic assemblages

Individual and institutional determinants of the male female wage gap among U.S. economics faculty

This paper provides new evidence on the male female wage gap in academia. Using unique data from the economics discipline, we estimate a human-capital based model to explore the nature of wage differentials among male and female economics professors. Results indicate the salary gap varies across systematically across individual and institutional characteristics.discrimination, wages, academia

NP-hardness of the cluster minimization problem revisited

The computational complexity of the "cluster minimization problem" is revisited [L. T. Wille and J. Vennik, J. Phys. A 18, L419 (1985)]. It is argued that the original NP-hardness proof does not apply to pairwise potentials of physical interest, such as those that depend on the geometric distance between the particles. A geometric analog of the original problem is formulated, and a new proof for such potentials is provided by polynomial time transformation from the independent set problem for unit disk graphs. Limitations of this formulation are pointed out, and new subproblems that bear more direct consequences to the numerical study of clusters are suggested.Comment: 8 pages, 2 figures, accepted to J. Phys. A: Math. and Ge

A shooting method for singular nonlinear second order Volterra integro-differential equations

The method of parallel shooting will be employed to solve nonlinear second order singular Volterra integro-differential equations with two point boundary conditions

Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints

For a given graph $G$ with positive integral cost and delay on edges, distinct vertices $s$ and $t$, cost bound $C\in Z^{+}$ and delay bound $D\in Z^{+}$, the $k$ bi-constraint path ($k$BCP) problem is to compute $k$ disjoint $st$-paths subject to $C$ and $D$. This problem is known NP-hard, even when $k=1$ \cite{garey1979computers}. This paper first gives a simple approximation algorithm with factor-$(2,2)$, i.e. the algorithm computes a solution with delay and cost bounded by $2*D$ and $2*C$ respectively. Later, a novel improved approximation algorithm with ratio $(1+\beta,\,\max\{2,\,1+\ln\frac{1}{\beta}\})$ is developed by constructing interesting auxiliary graphs and employing the cycle cancellation method. As a consequence, we can obtain a factor-$(1.369,\,2)$ approximation algorithm by setting $1+\ln\frac{1}{\beta}=2$ and a factor-$(1.567,\,1.567)$ algorithm by setting $1+\beta=1+\ln\frac{1}{\beta}$. Besides, by setting $\beta=0$, an approximation algorithm with ratio $(1,\, O(\ln n))$, i.e. an algorithm with only a single factor ratio $O(\ln n)$ on cost, can be immediately obtained. To the best of our knowledge, this is the first non-trivial approximation algorithm for the $k$BCP problem that strictly obeys the delay constraint.Comment: 12 page

Maximum weight cycle packing in directed graphs, with application to kidney exchange programs

Centralized matching programs have been established in several countries to organize kidney exchanges between incompatible patient-donor pairs. At the heart of these programs are algorithms to solve kidney exchange problems, which can be modelled as cycle packing problems in a directed graph, involving cycles of length 2, 3, or even longer. Usually, the goal is to maximize the number of transplants, but sometimes the total benefit is maximized by considering the differences between suitable kidneys. These problems correspond to computing cycle packings of maximum size or maximum weight in directed graphs. Here we prove the APX-completeness of the problem of finding a maximum size exchange involving only 2-cycles and 3-cycles. We also present an approximation algorithm and an exact algorithm for the problem of finding a maximum weight exchange involving cycles of bounded length. The exact algorithm has been used to provide optimal solutions to real kidney exchange problems arising from the National Matching Scheme for Paired Donation run by NHS Blood and Transplant, and we describe practical experience based on this collaboration

Identification of network modules by optimization of ratio association

We introduce a novel method for identifying the modular structures of a network based on the maximization of an objective function: the ratio association. This cost function arises when the communities detection problem is described in the probabilistic autoencoder frame. An analogy with kernel k-means methods allows to develop an efficient optimization algorithm, based on the deterministic annealing scheme. The performance of the proposed method is shown on a real data set and on simulated networks

Quantum Separability and Entanglement Detection via Entanglement-Witness Search and Global Optimization

We focus on determining the separability of an unknown bipartite quantum state $\rho$ by invoking a sufficiently large subset of all possible entanglement witnesses given the expected value of each element of a set of mutually orthogonal observables. We review the concept of an entanglement witness from the geometrical point of view and use this geometry to show that the set of separable states is not a polytope and to characterize the class of entanglement witnesses (observables) that detect entangled states on opposite sides of the set of separable states. All this serves to motivate a classical algorithm which, given the expected values of a subset of an orthogonal basis of observables of an otherwise unknown quantum state, searches for an entanglement witness in the span of the subset of observables. The idea of such an algorithm, which is an efficient reduction of the quantum separability problem to a global optimization problem, was introduced in PRA 70 060303(R), where it was shown to be an improvement on the naive approach for the quantum separability problem (exhaustive search for a decomposition of the given state into a convex combination of separable states). The last section of the paper discusses in more generality such algorithms, which, in our case, assume a subroutine that computes the global maximum of a real function of several variables. Despite this, we anticipate that such algorithms will perform sufficiently well on small instances that they will render a feasible test for separability in some cases of interest (e.g. in 3-by-3 dimensional systems)

Decreased numerical density of kainate receptor-positive neurons in the orbitofrontal cortex of chronic schizophrenics

We utilised postmortem brain tissue to quantify sections of left and right orbitofrontal cortex (area 11) from nine schizophrenic and eight control patients from the Charing Cross Prospective Schizophrenia Study immunostained for the presence of the kainate receptor (GluR5/6/7). The numerical density of neurons immunopositive for kainate receptor was measured. Other sections from the same blocks were stained with cresyl violet to determine the total neuronal numerical density. All measurements were made blind: diagnoses were only revealed by a third party after measurements were completed. There was a significant reduction (21%) in numerical density of kainate receptor-positive neurons in both cortices in the schizophrenic group (488cells/mm2) compared to that in the control group (618cells/mm2) (P=0.033). Nissl-stained tissue showed no significant difference in total neuronal numerical density between control and schizophrenic groups. These observations suggest that there are actually fewer kainate receptor-positive neurons in schizophrenic orbitofrontal cortex. There was no correlation of reduced kainate receptor-positive cell number with age at death, postmortem interval, or other possibly confounding neuropathology. Our results support the concept of there being reduced glutamatergic activity in frontal cortex in schizophreni