Stochastic simulations of the Madden-Julian oscillation activity

The Madden-Julian oscillation (MJO) is the most prominent form of tropical intraseasonal variability. This study investigated the following questions. Do inter-annual-to-decadal variations in tropical sea surface temperature (SST) lead to substantial changes in MJO activity? Was there a change in the MJO in the 1970s? Can this change be associated to SST anomalies? What was the level of MJO activity in the pre-reanalysis era? These questions were investigated with a stochastic model of the MJO. Reanalysis data (1948-2008) were used to develop a nine-state first order Markov model capable to simulate the non-stationarity of the MJO. The model is driven by observed SST anomalies and a large ensemble of simulations was performed to infer the activity of the MJO in the instrumental period (1880-2008). The model is capable to reproduce the activity of the MJO during the reanalysis period. The simulations indicate that the MJO exhibited a regime of near normal activity in 1948-1972 (3.4 events year(-1)) and two regimes of high activity in 1973-1989 (3.9 events) and 1990-2008 (4.6 events). Stochastic simulations indicate decadal shifts with near normal levels in 1880-1895 (3.4 events), low activity in 1896 1917 (2.6 events) and a return to near normal levels during 1918-1947 (3.3 events). The results also point out to significant decadal changes in probabilities of very active years (5 or more MJO events): 0.214 (1880-1895), 0.076 (1896-1917), 0.197 (1918-1947) and 0.193 (1948-1972). After a change in behavior in the 1970s, this probability has increased to 0.329 (1973-1989) and 0.510 (1990-2008). The observational and stochastic simulations presented here call attention to the need to further understand the variability of the MJO on a wide range of time scales.

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.

Effects of intensity and positional predictability of a visual stimulus on simple reaction time

The influence of visual stimuli intensity on manual reaction time (RT) was investigated under two different attentional settings: high (Experiment 1) and low (Experiment 2) stimulus location predictability. These two experiments were also run under both binocular and monocular viewing conditions. We observed that RT decreased as stimulus intensity increased. It also decreased as the viewing condition was changed from monocular to binocular as well as the location predictability shifted from low to high. A significant interaction was found between stimulus intensity and viewing condition, but no interaction was observed between neither of these factors and location predictability. These findings support the idea that the stimulus intensity effect arises from purely sensory, pre-attentive mechanisms rather than deriving from more efficient attentional capture. (C) 2010 Elsevier Ireland Ltd. All rights reserved.

The relation between action, predictability and temporal contiguity in temporal binding

Previous studies have documented a subjective temporal attraction between actions and their effects. This finding, named intentional binding, is thought to be the result of a cognitive function that links actions to their consequences. Although several studies have tried to outline the necessary and sufficient conditions for intentional binding, a quantitative comparison between the roles of temporal contiguity, predictability and voluntary action and the evaluation of their interactions is difficult due to the high variability of the temporal binding measurements. In the present study, we used a novel methodology to investigate the properties of intentional binding. Subjects judged whether an auditory stimulus, which could either be triggered by a voluntary finger lift or be presented after a visual temporal marker unrelated to any action, was presented synchronously with a reference stimulus. In three experiments, the predictability, the interval between action and consequence and the presence of action itself were manipulated. The results indicate that (1) action is a necessary condition for temporal binding; (2) a fixed interval between the two events is not sufficient to cause the effect and (3) only in the presence of voluntary action do temporal predictability and contiguity play a significant role in modulating the effect.These findings are discussed in the context of the relationship between intentional binding and temporal expectation. (C) 2010 Elsevier B.V. All rights reserved.

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.

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.

Measuring time series predictability using support vector regression

Most studies involving statistical time series analysis rely on assumptions of linearity, which by its simplicity facilitates parameter interpretation and estimation. However, the linearity assumption may be too restrictive for many practical applications. The implementation of nonlinear models in time series analysis involves the estimation of a large set of parameters, frequently leading to overfitting problems. In this article, a predictability coefficient is estimated using a combination of nonlinear autoregressive models and the use of support vector regression in this model is explored. We illustrate the usefulness and interpretability of results by using electroencephalographic records of an epileptic patient.