Abnormal cortical network activation in human amnesia: A high-resolution evoked potential study.

Little is known about how human amnesia affects the activation of cortical networks during memory processing. In this study, we recorded high-density evoked potentials in 12 healthy control subjects and 11 amnesic patients with various types of brain damage affecting the medial temporal lobes, diencephalic structures, or both. Subjects performed a continuous recognition task composed of meaningful designs. Using whole-scalp spatiotemporal mapping techniques, we found that, during the first 200 ms following picture presentation, map configuration of amnesics and controls were indistinguishable. Beyond this period, processing significantly differed. Between 200 and 350 ms, amnesic patients expressed different topographical maps than controls in response to new and repeated pictures. From 350 to 550 ms, healthy subjects showed modulation of the same maps in response to new and repeated items. In amnesics, by contrast, presentation of repeated items induced different maps, indicating distinct cortical processing of new and old information. The study indicates that cortical mechanisms underlying memory formation and re-activation in amnesia fundamentally differ from normal memory processing.

A randomized concave programming method for choice network revenue management

Models incorporating more realistic models of customer behavior, as customers choosing froman offer set, have recently become popular in assortment optimization and revenue management.The dynamic program for these models is intractable and approximated by a deterministiclinear program called the CDLP which has an exponential number of columns. However, whenthe segment consideration sets overlap, the CDLP is difficult to solve. Column generationhas been proposed but finding an entering column has been shown to be NP-hard. In thispaper we propose a new approach called SDCP to solving CDLP based on segments and theirconsideration sets. SDCP is a relaxation of CDLP and hence forms a looser upper bound onthe dynamic program but coincides with CDLP for the case of non-overlapping segments. Ifthe number of elements in a consideration set for a segment is not very large (SDCP) can beapplied to any discrete-choice model of consumer behavior. We tighten the SDCP bound by(i) simulations, called the randomized concave programming (RCP) method, and (ii) by addingcuts to a recent compact formulation of the problem for a latent multinomial-choice model ofdemand (SBLP+). This latter approach turns out to be very effective, essentially obtainingCDLP value, and excellent revenue performance in simulations, even for overlapping segments.By formulating the problem as a separation problem, we give insight into why CDLP is easyfor the MNL with non-overlapping considerations sets and why generalizations of MNL posedifficulties. We perform numerical simulations to determine the revenue performance of all themethods on reference data sets in the literature.

Dietary folates and cancer risk in a network of case-control studies.

Background Folate deficiency leads to DNA damage and inadequate repair, caused by a decreased synthesis of thymidylate and purines. We analyzed the relationship between dietary folate intake and the risk of several cancers. Patients and methods The study is based on a network of case-control studies conducted in Italy and Switzerland in 1991-2009. The odds ratios (ORs) for dietary folate intake were estimated by multiple logistic regression models, adjusted for major identified confounding factors. Results For a few cancer sites, we found a significant inverse relation, with ORs for an increment of 100 μg/day of dietary folate of 0.65 for oropharyngeal (1467 cases), 0.58 for esophageal (505 cases), 0.83 for colorectal (2390 cases), 0.72 for pancreatic (326 cases), 0.67 for laryngeal (851 cases) and 0.87 for breast (3034 cases) cancers. The risk estimates were below unity, although not significantly, for cancers of the endometrium (OR = 0.87, 454 cases), ovary (OR = 0.86, 1031 cases), prostate (OR = 0.91, 1468 cases) and kidney (OR = 0.88, 767 cases), and was 1.00 for stomach cancer (230 cases). No material heterogeneity was found in strata of sex, age, smoking and alcohol drinking. Conclusions Our data support a real inverse association of dietary folate intake with the risk of several common cancers.

A tractable consideration set structure for network revenue management

Models incorporating more realistic models of customer behavior, as customers choosing from an offerset, have recently become popular in assortment optimization and revenue management. The dynamicprogram for these models is intractable and approximated by a deterministic linear program called theCDLP which has an exponential number of columns. When there are products that are being consideredfor purchase by more than one customer segment, CDLP is difficult to solve since column generationis known to be NP-hard. However, recent research indicates that a formulation based on segments withcuts imposing consistency (SDCP+) is tractable and approximates the CDLP value very closely. In thispaper we investigate the structure of the consideration sets that make the two formulations exactly equal.We show that if the segment consideration sets follow a tree structure, CDLP = SDCP+. We give acounterexample to show that cycles can induce a gap between the CDLP and the SDCP+ relaxation.We derive two classes of valid inequalities called flow and synchronization inequalities to further improve(SDCP+), based on cycles in the consideration set structure. We give a numeric study showing theperformance of these cycle-based cuts.

Diabetes mellitus and cancer risk in a network of case-control studies.

Diabetes has been associated to the risk of a few cancer sites, though quantification of this association in various populations remains open to discussion. We analyzed the relation between diabetes and the risk of various cancers in an integrated series of case-control studies conducted in Italy and Switzerland between 1991 and 2009. The studies included 1,468 oral and pharyngeal, 505 esophageal, 230 gastric, 2,390 colorectal, 185 liver, 326 pancreatic, 852 laryngeal, 3,034 breast, 607 endometrial, 1,031 ovarian, 1,294 prostate, and 767 renal cell cancer cases and 12,060 hospital controls. The multivariate odds ratios (OR) for subjects with diabetes as compared to those without-adjusted for major identified confounding factors for the cancers considered through logistic regression models-were significantly elevated for cancers of the oral cavity/pharynx (OR = 1.58), esophagus (OR = 2.52), colorectum (OR = 1.23), liver (OR = 3.52), pancreas (OR = 3.32), postmenopausal breast (OR = 1.76), and endometrium (OR = 1.70). For cancers of the oral cavity, esophagus, colorectum, liver, and postmenopausal breast, the excess risk persisted over 10 yr since diagnosis of diabetes. Our data confirm and further quantify the association of diabetes with colorectal, liver, pancreatic, postmenopausal breast, and endometrial cancer and suggest forthe first time that diabetes may also increase the risk of oral/pharyngeal and esophageal cancer. [Table: see text] [Table: see text].

Equivalence of piecewise-linear approximation and Lagrangian relaxation for network revenue management

The network revenue management (RM) problem arises in airline, hotel, media,and other industries where the sale products use multiple resources. It can be formulatedas a stochastic dynamic program but the dynamic program is computationallyintractable because of an exponentially large state space, and a number of heuristicshave been proposed to approximate it. Notable amongst these -both for their revenueperformance, as well as their theoretically sound basis- are approximate dynamic programmingmethods that approximate the value function by basis functions (both affinefunctions as well as piecewise-linear functions have been proposed for network RM)and decomposition methods that relax the constraints of the dynamic program to solvesimpler dynamic programs (such as the Lagrangian relaxation methods). In this paperwe show that these two seemingly distinct approaches coincide for the network RMdynamic program, i.e., the piecewise-linear approximation method and the Lagrangianrelaxation method are one and the same.