Time-varying price discovery in the eighteenth century: empirical evidence from the London and Amsterdam stock markets

This paper examines the time-varying nature of price discovery in eighteenth century cross-listed stocks. Specifically, we investigate how quickly news is reflected in prices for two of the great moneyed com- panies, the Bank of England and the East India Company, over the period 1723 to 1794. These British companies were cross-listed on the London and Amsterdam stock exchange and news between the capitals flowed mainly via the use of boats that transported mail. We examine in detail the historical context sur- rounding the defining events of the period, and use these as a guide to how the data should be analysed. We show that both trading venues contributed to price discovery, and although the London venue was more important for these stocks, its importance varies over time.

The option market reaction to bank loan announcements

In this study, we examine the options market reaction to bank loan announcements for the population of US firms with traded options and loan announcements during 1996-2010. We get evidence on a significant options market reaction to bank loan announcements in terms of levels and changes in short-term implied volatility and its term structure, and observe significant decreases in short-term implied volatility, and significant increases in the slope of its term structure as a result of loan announcements. Our findings appear to be more pronounced for firms with more information asymmetry, lower credit ratings and loans with longer maturities and higher spreads. Evidence is consistent with loan announcements providing reassurance for investors in the short-term, however, over longer time horizons, the increase in the TSIV slope indicates that investors become increasingly unsure over the potential risks of loan repayment or uses of the proceeds.

Jump and variance risk premia in the S&P 500

We analyze the risk premia embedded in the S&P 500 spot index and option markets. We use a long time-series of spot prices and a large panel of option prices to jointly estimate the diffusive stock risk premium, the price jump risk premium, the diffusive variance risk premium and the variance jump risk premium. The risk premia are statistically and economically significant and move over time. Investigating the economic drivers of the risk premia, we are able to explain up to 63 % of these variations.

Moral uncertainty and permissibility: evaluating option sets

In this essay, we explore an issue of moral uncertainty: what we are permitted to do when we are unsure about which moral principles are correct. We develop a novel approach to this issue that incorporates important insights from previous work on moral uncertainty, while avoiding some of the difficulties that beset existing alternative approaches. Our approach is based on evaluating and choosing between option sets rather than particular conduct options. We show how our approach is particularly well-suited to address this issue of moral uncertainty with respect to agents that have credence in moral theories that are not fully consequentialist.

CONSIDERATIONS ON THE REINTRODUCTION AND RECOVERY OF THE ALAGOAS CURASSOW MITU MITU (LINNAEUS, 1766) FROM EXTINCTION USING A POTENTIALLY HYBRID CAPTIVE STOCK

The Alagoas Curassow Mitu mitu is considered extinct in the wild. Since 1979, two females and a male caught in the wild have bred successfully in captivity, and, in 1990, hybridizations between M. mitu and Razor-billed Mitu M. tuberosum were performed. By June 2008, there were around 130 living birds in two different aviaries. We sequenced two regions of the mitochondrial DNA of both captive stocks of Alagoas Curassows. We unequivocally identified hybrids that have haplotype typical of M. tuberosum. However, unless the original studbook can be recovered there is no confident way to discriminate ""pure"" M. mitu birds for breeding and reintroduction purposes. Allied with morphological data gathered in an independent study, we suggest that conservation actions need to focus on specimens with diagnostic phenotypic characters of M. mitu, and avoid birds with mitochondria, genetic contribution of M. tuberosum. Although we have detected low levels of genetic variability among captive birds, the steady increase of the captive population suggests that inbreeding depression and hybridization are not a reproductive hindrance. Reintroduction of some of these potential hybrid birds in the original area of occurrence of the Alagoas Curassow may be the only hope to fill in the ecological niche left vacant. An educational program involving local communities to conserve future reintroduction of curassows and their restored habitat is highly recommended. Accepted 12 November 2009.

On the cutting stock problem under stochastic demand

This paper addresses the one-dimensional cutting stock problem when demand is a random variable. The problem is formulated as a two-stage stochastic nonlinear program with recourse. The first stage decision variables are the number of objects to be cut according to a cutting pattern. The second stage decision variables are the number of holding or backordering items due to the decisions made in the first stage. The problem`s objective is to minimize the total expected cost incurred in both stages, due to waste and holding or backordering penalties. A Simplex-based method with column generation is proposed for solving a linear relaxation of the resulting optimization problem. The proposed method is evaluated by using two well-known measures of uncertainty effects in stochastic programming: the value of stochastic solution-VSS-and the expected value of perfect information-EVPI. The optimal two-stage solution is shown to be more effective than the alternative wait-and-see and expected value approaches, even under small variations in the parameters of the problem.

Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths

This paper deals with the classical one-dimensional integer cutting stock problem, which consists of cutting a set of available stock lengths in order to produce smaller ordered items. This process is carried out in order to optimize a given objective function (e.g., minimizing waste). Our study deals with a case in which there are several stock lengths available in limited quantities. Moreover, we have focused on problems of low demand. Some heuristic methods are proposed in order to obtain an integer solution and compared with others. The heuristic methods are empirically analyzed by solving a set of randomly generated instances and a set of instances from the literature. Concerning the latter. most of the optimal solutions of these instances are known, therefore it was possible to compare the solutions. The proposed methods presented very small objective function value gaps. (C) 2008 Elsevier Ltd. All rights reserved.

A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem

Industrial production processes involving both lot-sizing and cutting stock problems are common in many industrial settings. However, they are usually treated in a separate way, which could lead to costly production plans. In this paper, a coupled mathematical model is formulated and a heuristic method based on Lagrangian relaxation is proposed. Computational results prove its effectiveness. (C) 2009 Elsevier B.V. All rights reserved.

A coupling cutting stock-lot sizing problem in the paper industry

An important production programming problem arises in paper industries coupling multiple machine scheduling with cutting stocks. Concerning machine scheduling: how can the production of the quantity of large rolls of paper of different types be determined. These rolls are cut to meet demand of items. Scheduling that minimizes setups and production costs may produce rolls which may increase waste in the cutting process. On the other hand, the best number of rolls in the point of view of minimizing waste may lead to high setup costs. In this paper, coupled modeling and heuristic methods are proposed. Computational experiments are presented.

Are biofuels a feasible option?

Recently a number of objections have been raised against the use of ethanol produced from agricultural products such as maize, sugarcane, wheat or sugar beets as a replacement for gasoline, despite some of their advantages such as being cleaner and to some extent renewable. We address these objections in this paper. Topics discussed include the ""corn connection"" (which was theorized to be a cause of deforestation in the Amazonia), the rise of food prices due to ethanol production and the real possibilities of ethanol in reducing greenhouse gas emissions. It has been shown that such concerns are grossly exaggerated and that ethanol from sugarcane, as produced in Brazil, is the preferred option for the production of fuel not only in terms of cost but also as a favourable energy balance. Finally, the possibility of expanding ethanol production to other sugar-producing countries is also discussed. (C) 2008 Elsevier Ltd. All rights reserved.

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.

Ca(2+)-mediated thiolysis of peptide-resin linkage as an option for preparing protected peptide thioesters

A mild new procedure for preparing protected peptide thioesters, based oil Ca(2+)-assisted thiolysis of peptide-Kaiser oxime resin (KOR) linkage, is described. Ac-Ile-Ser(Bzl)-Asp(OcHx)-SR (Ac: acetyl; Bzl: benzyl; cHx: cyclohexyl), model peptide, was readily released from the resin by incubating the peptide-KOR at 60 degrees C in mixtures of DMF with n-butanethiol [R = (CH(2))(3)CH(3)] or ethyl 3-mercaptopropionate [R = (CH(2))(2)COOCHCH(3)] containing Ca(CH(3)COO)(2). After serine and aspartic acid side-chain deprotection under acid conditions, Ac-Ile-Ser-Asp-S(CH(2))(2)COOCH(2)CH(3) was successfully obtained with good quality and high yield. This type of C-terminal modified peptide may act as an excellent acyl donor in peptide segment condensation by the thioester method, native chemical ligation and enzymatic methods. (c) 2008 Elsevier Ltd. All rights reserved.