Middle and Late Pleistocene humid periods recorded in palaeolake deposits of the Nafud desert, Saudi Arabia

Present climate in the Nafud desert of northern Saudi Arabia is hyper-arid and moisture brought by north-westerly winds scarcely reaches the region. The existence of abundant palaeolake sediments provides evidence for a considerably wetter climate in the past. However, the existing chronological framework of these deposits is solely based on radiocarbon dating of questionable reliability, due to potential post-depositional contamination with younger 14C. By using luminescence dating, we show that the lake deposits were not formed between 40 and 20 ka as suggested previously, but approximately ca 410 ka, 320 ka, 200 ka, 125 ka, and 100 ka ago. All of these humid phases are in good agreement with those recorded in lake sediments and speleothems from southern Arabia. Surprisingly, no Holocene lake deposits were identified. Geological characteristics of the deposits and diatom analysis suggest that a single, perennial lake covered the entire south-western Nafud ca 320 ka ago. In contrast, lakes of the 200 ka, 125 ka, and 100 ka humid intervals were smaller and restricted to interdune depressions of a pre-existing dune relief. The concurrent occurrence of humid phases in the Nafud, southern Arabia and the eastern Mediterranean suggests that moisture in northern Arabia originated either from the Mediterranean due to more frequent frontal depression systems or from stronger Indian monsoon circulation, respectively. However, based on previously published climate model simulations and palaecolimate evidence from central Arabia and the Negev desert, we argue that humid climate conditions in the Nafud were probably caused by a stronger African monsoon and a distinct change in zonal atmospheric circulation.

Queering Philip Roth: homosocial discourse in 'An actor’s life for me', 'Letting go', 'Sabbath’s theater' and the 'American trilogy'

Much has been written on Roth’s representation of masculinity, but this critical discourse has tended to be situated within a heteronormative frame of reference, perhaps because of Roth’s popular reputation as an aggressively heterosexual, libidinous, masculinist, in some versions sexist or even misogynist author. In this essay I argue that Roth’s representation of male sexuality is more complex, ambiguous, and ambivalent than has been generally recognized. Tracing a strong thread of what I call homosocial discourse running through Roth’s oeuvre, I suggest that the series of intimate relationships with other men that many of Roth’s protagonists form are conspicuously couched in this discourse and that a recognition of this ought to reconfigure our sense of the sexual politics of Roth’s career, demonstrating in particular that masculinity in his work is too fluid and dynamic to be accommodated by the conventional binaries of heterosexual and homosexual, feminized Jew and hyper-masculine Gentile, the “ordinary sexual man” and the transgressively desiring male subject.

Accountability and ideology: when left looks right and right looks left

Abstract Managers face hard choices between process and outcome systems of accountability in evaluating employees, but little is known about how managers resolve them. Building on the premise that political ideologies serve as uncertainty-reducing heuristics, two studies of working managers show that: (1) conservatives prefer outcome accountability and liberals prefer process accountability in an unspecified policy domain; (2) this split becomes more pronounced in a controversial domain (public schools) in which the foreground value is educational efficiency but reverses direction in a controversial domain (affirmative action) in which the foreground value is demographic equality; (3) managers who discover employees have subverted their preferred system favor tinkering over switching to an alternative system; (4) but bipartisan consensus arises when managers have clear evidence about employee trustworthiness and the tightness of the causal links between employee effort and success. These findings shed light on ideological and contextual factors that shape preferences for accountability systems.

An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters

Bloom filters are a data structure for storing data in a compressed form. They offer excellent space and time efficiency at the cost of some loss of accuracy (so-called lossy compression). This work presents a yes-no Bloom filter, which as a data structure consisting of two parts: the yes-filter which is a standard Bloom filter and the no-filter which is another Bloom filter whose purpose is to represent those objects that were recognised incorrectly by the yes-filter (that is, to recognise the false positives of the yes-filter). By querying the no-filter after an object has been recognised by the yes-filter, we get a chance of rejecting it, which improves the accuracy of data recognition in comparison with the standard Bloom filter of the same total length. A further increase in accuracy is possible if one chooses objects to include in the no-filter so that the no-filter recognises as many as possible false positives but no true positives, thus producing the most accurate yes-no Bloom filter among all yes-no Bloom filters. This paper studies how optimization techniques can be used to maximize the number of false positives recognised by the no-filter, with the constraint being that it should recognise no true positives. To achieve this aim, an Integer Linear Program (ILP) is proposed for the optimal selection of false positives. In practice the problem size is normally large leading to intractable optimal solution. Considering the similarity of the ILP with the Multidimensional Knapsack Problem, an Approximate Dynamic Programming (ADP) model is developed making use of a reduced ILP for the value function approximation. Numerical results show the ADP model works best comparing with a number of heuristics as well as the CPLEX built-in solver (B&B), and this is what can be recommended for use in yes-no Bloom filters. In a wider context of the study of lossy compression algorithms, our researchis an example showing how the arsenal of optimization methods can be applied to improving the accuracy of compressed data.

Alan Rugman’s methodology

This paper argues that the intellectual contribution of Alan Rugman reflects his distinctive research methodology. Alan Rugman trained as an economist, and relied heavily on economic principles throughout his work. He believed that one good theory was sufficient for IB studies, and that theory, he maintained, was internalisation theory. He rejected theoretical pluralism, and believed that IB suffered from a surfeit of theories. Alan was a positivist. The test of a good theory was that it led to clear predictions which were corroborated by empirical evidence. Many IB theories, Alan believed, were weak; their proliferation sowed confusion and they needed to be refuted. Alan’s interpretation of internalisation was, however, unconventional in some respects. He played down the trade-offs presented in Coase’s original work, and substituted heuristics in their place. Instead of analysing internalisation as a context-specific choice between alternative contractual arrangements, he presented it as a strategic imperative for firms possessing strong knowledge advantages. His heuristics did not apply to every possible case, but in Alan’s view they applied in the great majority of cases and were therefore a basis for management action.

Proanthocyanidins inhibit Ascaris suum glutathione-S-transferase activity and increase susceptibility of larvae to levamisole and ivermectin in vitro

Proanthocyanidins (PAC) are a class of plant secondary metabolites commonly found in the diet that have shown potential to control gastrointestinal nematode infections. The anti-parasitic mechanism(s) of PAC remain obscure, however the protein-binding properties of PAC suggest that disturbance of key enzyme functions may be a potential mode of action. Glutathione-S-transferases (GSTs) are essential for parasite detoxification and have been investigated as drug and vaccine targets. Here, we show that purified PAC strongly inhibit the activity of both recombinant and native GSTs from the parasitic nematode Ascaris suum. As GSTs are involved in detoxifying xenobiotic substances within the parasite, we hypothesised that this inhibition may render parasites hyper-susceptible to anthelmintic drugs. Migration inhibition assays with A. suum larvae demonstrated that the potency of levamisole (LEV) and ivermectin (IVM) were significantly increased in the presence of PAC purified from pine bark (4.6-fold and 3.2-fold reduction in IC50 value for LEV and IVM, respectively). Synergy analysis revealed that the relationship between PAC and LEV appeared to be synergistic in nature, suggesting a specific enhancement of LEV activity, whilst the relationship between PAC and IVM was additive rather than synergistic, suggesting independent actions. Our results demonstrate that these common dietary compounds may increase the efficacy of synthetic anthelmintic drugs in vitro, and also suggest one possible mechanism for their well-known anti-parasitic activity.

Toll-like receptor 4 agonists adsorbed to aluminium hydroxide adjuvant attenuate ovalbumin-specific allergic airway disease: role of MyD88 adaptor molecule and interleukin-12/interferon-gamma axis

Background Epidemiological and experimental data suggest that bacteria] lipopolysaccharides (LPS) can either protect from or exacerbate allergic asthma. Lipopolysaccharides trigger immune responses through toll-like receptor 4 (TLR4) that in turn activates two major signalling pathways via either MyD88 or TRIF adaptor proteins. The LPS is a pro-Type 1 T helper cells (Th 1) adjuvant while aluminium hydroxide (alum) is a strong Type 2 T helper cells (Th2) adjuvant, but the effect of the mixing of both adjuvants on the development of lung allergy has not been investigated. Objective We determined whether natural (LPS) or synthetic (ER-803022) TLR4 agonists adsorbed onto alum adjuvant affect allergen sensitization and development of airway allergic disease. To dissect LPS-induced molecular pathways, we used TLR4-, MyD88-, TRIF-, or IL-12/IFN-gamma-deficient mice. Methods Mice were sensitized with subcutaneous injections of ovalbumin (OVA) with or without TLR4 agonists co-adsorbed onto alum and challenged with intranasally with OVA. The development of allergic lung disease was evaluated 24 h after last OVA challenge. Results Sensitization with OVA plus LPS co-adsorbed onto alum impaired in dose-dependent manner OVA-induced Th2-mediated allergic responses such as airway eosinophilia, type-2 cytokines secretion, airway hyper-reactivity, mucus hyper production and serum levels of IgE or IgG1 anaphylactic antibodies. Although the levels of IgG2a, Th1 -affiliated isotype increased, investigation into the lung-specific effects revealed that LPS did not induce a Th1 pattern of inflammation. Lipopolysaccharides impaired the development of Th2 immunity, signaling via TLR4 and MyD88 molecules and via the IL-12/IFN-gamma axis, but not through TRIF pathway. Moreover, the synthetic TLR4 agonists that proved to have a less systemic inflammatory response than LPS also protected against allergic asthma development. Conclusion Toll-like receptor 4 agonists co-adsorbed with allergen onto alum down-modulate allergic lung disease and prevent the development of polarized T cell-mediated airway inflammation.

On the efficiency of evolutionary fuzzy clustering

This paper tackles the problem of showing that evolutionary algorithms for fuzzy clustering can be more efficient than systematic (i.e. repetitive) approaches when the number of clusters in a data set is unknown. To do so, a fuzzy version of an Evolutionary Algorithm for Clustering (EAC) is introduced. A fuzzy cluster validity criterion and a fuzzy local search algorithm are used instead of their hard counterparts employed by EAC. Theoretical complexity analyses for both the systematic and evolutionary algorithms under interest are provided. Examples with computational experiments and statistical analyses are also presented.

The constrained compartmentalized knapsack problem: mathematical models and solution methods

The constrained compartmentalized knapsack problem can be seen as an extension of the constrained knapsack problem. However, the items are grouped into different classes so that the overall knapsack has to be divided into compartments, and each compartment is loaded with items from the same class. Moreover, building a compartment incurs a fixed cost and a fixed loss of the capacity in the original knapsack, and the compartments are lower and upper bounded. The objective is to maximize the total value of the items loaded in the overall knapsack minus the cost of the compartments. This problem has been formulated as an integer non-linear program, and in this paper, we reformulate the non-linear model as an integer linear master problem with a large number of variables. Some heuristics based on the solution of the restricted master problem are investigated. A new and more compact integer linear model is also presented, which can be solved by a branch-and-bound commercial solver that found most of the optimal solutions for the constrained compartmentalized knapsack problem. On the other hand, heuristics provide good solutions with low computational effort. (C) 2011 Elsevier BM. All rights reserved.

Two-level network design with intermediate facilities: An application to electrical distribution systems

We consider the two-level network design problem with intermediate facilities. This problem consists of designing a minimum cost network respecting some requirements, usually described in terms of the network topology or in terms of a desired flow of commodities between source and destination vertices. Each selected link must receive one of two types of edge facilities and the connection of different edge facilities requires a costly and capacitated vertex facility. We propose a hybrid decomposition approach which heuristically obtains tentative solutions for the vertex facilities number and location and use these solutions to limit the computational burden of a branch-and-cut algorithm. We test our method on instances of the power system secondary distribution network design problem. The results show that the method is efficient both in terms of solution quality and computational times. (C) 2010 Elsevier Ltd. All rights reserved.

Crop rotation scheduling with adjacency constraints

In this article we propose a 0-1 optimization model to determine a crop rotation schedule for each plot in a cropping area. The rotations have the same duration in all the plots and the crops are selected to maximize plot occupation. The crops may have different production times and planting dates. The problem includes planting constraints for adjacent plots and also for sequences of crops in the rotations. Moreover, cultivating crops for green manuring and fallow periods are scheduled into each plot. As the model has, in general, a great number of constraints and variables, we propose a heuristics based on column generation. To evaluate the performance of the model and the method, computational experiments using real-world data were performed. The solutions obtained indicate that the method generates good results.

Infeasibility handling in genetic algorithm using nested domains for production planning

In this paper we present a genetic algorithm with new components to tackle capacitated lot sizing and scheduling problems with sequence dependent setups that appear in a wide range of industries, from soft drink bottling to food manufacturing. Finding a feasible solution to highly constrained problems is often a very difficult task. Various strategies have been applied to deal with infeasible solutions throughout the search. We propose a new scheme of classifying individuals based on nested domains to determine the solutions according to the level of infeasibility, which in our case represents bands of additional production hours (overtime). Within each band, individuals are just differentiated by their fitness function. As iterations are conducted, the widths of the bands are dynamically adjusted to improve the convergence of the individuals into the feasible domain. The numerical experiments on highly capacitated instances show the effectiveness of this computational tractable approach to guide the search toward the feasible domain. Our approach outperforms other state-of-the-art approaches and commercial solvers. (C) 2009 Elsevier Ltd. All rights reserved.

GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem

This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a path-relinking intensification procedure to find cost-effective solutions for this problem. In addition, the proposed heuristics is used to solve some instances of the capacitated lot sizing problem with parallel machines. The results of the computational tests show that the proposed heuristics outperform other heuristics previously described in the literature. The results are confirmed by statistical tests. (C) 2009 Elsevier B.V. All rights reserved.

Job rotation in assembly lines employing disabled workers

In this paper we consider the programming of job rotation in the assembly line worker assignment and balancing problem. The motivation for this study comes from the designing of assembly lines in sheltered work centers for the disabled, where workers have different task execution times. In this context, the well-known training aspects associated with job rotation are particularly desired. We propose a metric along with a mixed integer linear model and a heuristic decomposition method to solve this new job rotation problem. Computational results show the efficacy of the proposed heuristics. (C) 2009 Elsevier B.V. All rights reserved.

Lot sizing and furnace scheduling in small foundries

A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (I the furnace scheduling of metal alloy production, and (2) moulding machine planning which specifies the type and size of production lots. A mixed integer programming (MIP) formulation of the problem is proposed, but is impractical to solve in reasonable computing time for non-small instances. As a result, a faster relax-and-fix (RF) approach is developed that can also be used on a rolling horizon basis where only immediate-term schedules are implemented. As well as a MIP method to solve the basic RF approach, three variants of a local search method are also developed and tested using instances based on the literature. Finally, foundry-based tests with a real-order book resulted in a very substantial reduction of delivery delays and finished inventory, better use of capacity, and much faster schedule definition compared to the foundry`s own practice. (c) 2006 Elsevier Ltd. All rights reserved.