The impact of experienced stress on aged spatial discrimination: Cortical overreliance as a result of hippocampal impairment

A large body of neuroscientific work indicates that exposure to experienced stress causes damage to both cortical and hippocampal cells and results in impairments to cognitive abilities associated with these structures. Similarly, work within the domain of cognitive aging demonstrates that elderly participants who report experiencing greater amounts of stress show reduced levels of cognitive functioning. The present article attempted to combine both findings by collecting data from elderly and young participants who completed a spatial discrimination paradigm developed by Reagh and colleagues [Reagh et al. (2013) Hippocampus 24:303-314] to measure hippocampal-mediated cognitive processes. In order to investigate the effect of stress on the cortex and, indirectly, the hippocampus, it paired the paradigm with electroencephalographic recordings of the theta frequency band, which is thought to reflect cortical/hippocampal interactions. Findings revealed that elderly participants with high levels of experienced stress performed significantly worse on target recognition and lure discrimination and demonstrated heightened levels of cortical theta synchronization compared with young and elderly low stress counterparts. Results therefore provided further evidence for the adverse effect of stress on cognitive aging and indicate that impaired behavioral performance among high stress elderly may coincide with an overreliance on cortical cognitive processing strategies as a result of early damage to the hippocampus

Efficient feasibility testing for dial-a-ride problems

Dial-a-Ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle operating agency requesting that an item be picked up from a specific location and delivered to a specific destination. Dial-a-ride problems differ from other routing and scheduling problems in that they typically involve service related constraints. It is common to have maximum wait time constraints and maximum ride time constraints. In the presence of maximum wait time and maximum ride time restrictions, it is not clear how to efficiently determine, given a sequence of pickups and deliveries, whether a feasible schedule exists. We demonstrate that this, in fact, can be done in linear time.

Digital Object Identifier Two-stage integer programs with stochastic right-hand sides: a superadditive dual approach

Abstract. We consider two-stage pure integer programs with discretely distributed stochastic right-hand sides. We present an equivalent superadditive dual formulation that uses the value functions in both stages. We give two algorithms for finding the value functions. To solve the reformulation after obtaining the value functions, we develop a global branch-and-bound approach and a level-set approach to find an optimal tender. We show that our method can solve randomly generated instances whose extensive forms are several orders of magnitude larger than the extensive forms of those instances found in the literature

Two-stage integer programs with stochastic right-hand sides

We consider two-stage pure integer programs with discretely distributed stochastic right-hand sides. We present an equivalent superadditive dual formulation that uses the value functions in both stages. We give two algorithms for finding the value functions. To solve the reformulation after obtaining the value functions, we develop a global branch-and-bound approach and a level-set approach to find an optimal tender. We show that our method can solve randomly generated instances that are several orders of magnitude larger than those found in the literature

Optimal Online Algorithms for Minimax Resource Scheduling

We consider a very general online scheduling problem with an objective to minimize the maximum level of resource allocated. We find a simple characterization of an optimal deterministic online algorithm. We develop further results for two more specific problems, single resource scheduling and hierarchical line balancing. We determine how to compute optimal online algorithms for both problems using linear programming and integer programming, respectively. We show that randomized algorithms can outperform deterministic algorithms, but only if the amount of work done is a non-concave function of resource allocation

How much do we “pay” for using default parameters?

Parameter tuning, Mixed integer programming, CPLEX, MIPLIB,