Earnings Returns to the British Education Expansion

We study the effects of the large expansion in British educational attainment that took place for cohorts born between 1970 and 1975. Using the Quarterly Labour Force Survey, we find that the expansion caused men to increase education by about a year on average and gain about 8% higher wages; women obtained a slightly greater increase in education and a similar increase in wages. Clearly, there was a sizeable gain from being born late enough to take advantage of the greater educational opportunities offered by the expansion. Treating the expansion as an exogenous increase in educational attainment, we obtain instrumental variables estimates of returns to schooling of about 6% for both men and women.return to education; higher education expansion

Crossing Patterns in Nonplanar Road Networks

We define the crossing graph of a given embedded graph (such as a road network) to be a graph with a vertex for each edge of the embedding, with two crossing graph vertices adjacent when the corresponding two edges of the embedding cross each other. In this paper, we study the sparsity properties of crossing graphs of real-world road networks. We show that, in large road networks (the Urban Road Network Dataset), the crossing graphs have connected components that are primarily trees, and that the remaining non-tree components are typically sparse (technically, that they have bounded degeneracy). We prove theoretically that when an embedded graph has a sparse crossing graph, it has other desirable properties that lead to fast algorithms for shortest paths and other algorithms important in geographic information systems. Notably, these graphs have polynomial expansion, meaning that they and all their subgraphs have small separators.Comment: 9 pages, 4 figures. To appear at the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems(ACM SIGSPATIAL 2017

Contingency-Constrained Unit Commitment with Post-Contingency Corrective Recourse

We consider the problem of minimizing costs in the generation unit commitment problem, a cornerstone in electric power system operations, while enforcing an N-k-e reliability criterion. This reliability criterion is a generalization of the well-known $N$-$k$ criterion, and dictates that at least $(1-e_ j)$ fraction of the total system demand must be met following the failures of $k$ or fewer system components. We refer to this problem as the Contingency-Constrained Unit Commitment problem, or CCUC. We present a mixed-integer programming formulation of the CCUC that accounts for both transmission and generation element failures. We propose novel cutting plane algorithms that avoid the need to explicitly consider an exponential number of contingencies. Computational studies are performed on several IEEE test systems and a simplified model of the Western US interconnection network, which demonstrate the effectiveness of our proposed methods relative to current state-of-the-art

Contingency-Constrained Unit Commitment With Intervening Time for System Adjustments

The N-1-1 contingency criterion considers the con- secutive loss of two components in a power system, with intervening time for system adjustments. In this paper, we consider the problem of optimizing generation unit commitment (UC) while ensuring N-1-1 security. Due to the coupling of time periods associated with consecutive component losses, the resulting problem is a very large-scale mixed-integer linear optimization model. For efficient solution, we introduce a novel branch-and-cut algorithm using a temporally decomposed bilevel separation oracle. The model and algorithm are assessed using multiple IEEE test systems, and a comprehensive analysis is performed to compare system performances across different contingency criteria. Computational results demonstrate the value of considering intervening time for system adjustments in terms of total cost and system robustness.Comment: 8 pages, 5 figure

Bovine Muscle Cathepsin D: Purification and Proteolytic Activity on Muscle Proteins

An affinity column for cathepsin D was prepared making use of the strong affinity of pepstatin for cathepsin D. Pepstatin is an N-acylated pentapeptide from Actinomycetes with the following structure: isovaleryl-L-valyl-L-valyl-4-amino-3-hydroxy-6-methylheptanoyl-L-alanyl-4-amino-3-hydroxy- 6-methyl heptanoic acid. A relatively rapid and efficient method for cathepsin D purification has been developed; Steps include homogenization, ammonium sulfate fractionation, and chromatography on pepstatin-Sepharose column. The final preparation has a specific activity of 38 units/mg. and shows a single protein band on polyacrylamide gel electrophoresis in sodium dodecyl sulfate corresponding to a subunit molecular weight of 42,000. Polyacrylamide gel electrophoresis studies did not reveal any impurities. The proteolytic activity of isolated cathepsin D on bovine myofibrils and myosin was examined at pH 3.80, 37 °C. The heavy chains of myosin, as well as other smaller regulatory proteins of the myofibrils were degraded. Actin was degraded less rapidly than myosin heavy chain. Degradation became more extensive when the substrate-enzyme incubation time was increased