Social network of family caregivers of disabled and dependent patients

Cross-sectional study that used the Social Network Index and the genogram to assess the social network of 110 family caregivers of dependent patients attended by a Home Care Service in São Paulo, Brazil. Data were analyzed using the test U of Mann-Whitney, Kruskal-Wallis and Spearman correlation. Results were considered statistically significant when p<0,05. Few caregivers participated in activities outside the home and the average number of people they had a bond was 4,4 relatives and 3,6 friends. Caregivers who reported pain and those who had a partner had higher average number of relatives who to trust. The average number of friends was higher in the group that reported use of medication for depression. Total and per capita incomes correlated with the social network. It was found that family members are the primary caregiver’s social network.





The Swiss Business Elite (1980-2000): How the Changing Composition of the Elite Explains the Decline of the Swiss Company Network

In this paper we analyse the decline of the Swiss corporate network between 1980 and 2000. We address the theoretical and methodological challenge of this transformation by the use of a combination of network analysis and multiple correspondence analysis (MCA). Based on a sample of top managers of the 110 largest Swiss companies in 1980 and 2000 we show that, beyond an adjustment to structural pressure, an explanation of the decline of the network has to include the strategies of the fractions of the business elites. We reveal that three factors contribute crucially to the decline of the Swiss corporate network: the managerialization of industrial leaders, the marginalization of law degree holders and the influx of hardly connected foreign managers.

Sex differences: From mental rotation to object location memory, an ERP study

Sex differences in cognition have been largely investigated. The most consistent sex differences favoring females are observed in object location memory involving the left hemisphere whereas the most consistent sex differences favoring males are observed in tasks that require mental rotation involving the right hemisphere. Here we used a task involving these two abilities to see the impact of mental rotation on object location memory. To that end we used a combination of behavioral and event-related potential (ERP) electroencephalography (EEG) measures.A computer screen displayed a square frame of 4 pairs of images (a "teddy" bear, a shoe, an umbrella and a lamp) randomly arranged around a central fixation cross. After a 10-second interval for memorization, images disappeared and were replaced by a test frame with no image but a random pair of two locations marked in black. In addition, this test frame was randomly displayed either in the original orientation (0° rotation) or in the rotated one (90° clockwise - CW - or 90° counterclockwise - CCW). Preceding the test frame, an arrow indicating the presence or the absence of rotation of the frame was displayed on the screen. The task of the participants (15 females and 15 males) was to determine if two marked locations corresponded or not to a pair of identical images. Each response was followed by feedback.Findings showed no significant sex differences in the performance of the original orientation. In comparison with this position, the rotation of the frame produced an equal decrease of male and female performance. In addition, this decrease was significantly higher when the rotation of the frame was in a CCW direction. We further assessed the ERP when the arrow indicated the direction of rotation as stimulus-onset, during four time windows representing major components C1, P1, N1 and N2. Although no sex differences were observed in performance, brain activities differed according to sex. Enhanced amplitudes were found for the CCW compared to CW rotation over the right posterior areas for the P1, N1 and N2 components for men as well as for women. Major topographical differences related to sex were measured for the CW rotation condition as marked lateralized amplitude: left-hemisphere amplitude larger than right one was measured during P1 time range for men. These similar patterns prolonged from P1 to N1 for women. Early distinctions were found in interaction with sex between CCW and CW waveform amplitudes, expressing over anterior electrode sites during C1 time range (0-50 ms post-stimulus).In conclusion (i) women do not outperform men in object location memory in this study (absence of rotation condition); (ii) mental rotation, in particular the direction of rotation, influences performance on object location memory; (iii) CCW rotation is associated with activity in the right parietal hemisphere whereas the CW rotation involves the left parietal hemisphere; (iv) this last effect is less pronounced in males, which could explain why greater involvement of right parietal areas in men and of bilateral posterior areas in women is generally reported in mental rotation tasks; and (v) the early distinctions between both directions of rotation located over anterior sites could be related to sex differences in their respective involvement of control mechanisms.

Clinical, polysomnographic and genome-wide association analyses of narcolepsy with cataplexy: a European Narcolepsy Network study.

The aim of this study was to describe the clinical and PSG characteristics of narcolepsy with cataplexy and their genetic predisposition by using the retrospective patient database of the European Narcolepsy Network (EU-NN). We have analysed retrospective data of 1099 patients with narcolepsy diagnosed according to International Classification of Sleep Disorders-2. Demographic and clinical characteristics, polysomnography and multiple sleep latency test data, hypocretin-1 levels, and genome-wide genotypes were available. We found a significantly lower age at sleepiness onset (men versus women: 23.74 ± 12.43 versus 21.49 ± 11.83, P = 0.003) and longer diagnostic delay in women (men versus women: 13.82 ± 13.79 versus 15.62 ± 14.94, P = 0.044). The mean diagnostic delay was 14.63 ± 14.31 years, and longer delay was associated with higher body mass index. The best predictors of short diagnostic delay were young age at diagnosis, cataplexy as the first symptom and higher frequency of cataplexy attacks. The mean multiple sleep latency negatively correlated with Epworth Sleepiness Scale (ESS) and with the number of sleep-onset rapid eye movement periods (SOREMPs), but none of the polysomnographic variables was associated with subjective or objective measures of sleepiness. Variant rs2859998 in UBXN2B gene showed a strong association (P = 1.28E-07) with the age at onset of excessive daytime sleepiness, and rs12425451 near the transcription factor TEAD4 (P = 1.97E-07) with the age at onset of cataplexy. Altogether, our results indicate that the diagnostic delay remains extremely long, age and gender substantially affect symptoms, and that a genetic predisposition affects the age at onset of symptoms.

Iowa Communications Network Performance Report, FY 2007

Agency Performance Report

PhD Students’ Research Group Social Capital in Two Countries: A Clustering Approach with Duocentred Network Measures

The article examines the structure of the collaboration networks of research groups where Slovenian and Spanish PhD students are pursuing their doctorate. The units of analysis are student-supervisor dyads. We use duocentred networks, a novel network structure appropriate for networks which are centred around a dyad. A cluster analysis reveals three typical clusters of research groups. Those which are large and belong to several institutions are labelled under a bridging social capital label. Those which are small, centred in a single institution but have high cohesion are labelled as bonding social capital. Those which are small and with low cohesion are called weak social capital groups. Academic performance of both PhD students and supervisors are highest in bridging groups and lowest in weak groups. Other variables are also found to differ according to the type of research group. At the end, some recommendations regarding academic and research policy are drawn

Locating emergency services with priority rules: The priority queuing covering location problem

One of the assumptions of the Capacitated Facility Location Problem (CFLP) is thatdemand is known and fixed. Most often, this is not the case when managers take somestrategic decisions such as locating facilities and assigning demand points to thosefacilities. In this paper we consider demand as stochastic and we model each of thefacilities as an independent queue. Stochastic models of manufacturing systems anddeterministic location models are put together in order to obtain a formula for thebacklogging probability at a potential facility location.Several solution techniques have been proposed to solve the CFLP. One of the mostrecently proposed heuristics, a Reactive Greedy Adaptive Search Procedure, isimplemented in order to solve the model formulated. We present some computationalexperiments in order to evaluate the heuristics performance and to illustrate the use ofthis new formulation for the CFLP. The paper finishes with a simple simulationexercise.

Network revenue management with product-specific no-shows

Revenue management practices often include overbooking capacity to account for customerswho make reservations but do not show up. In this paper, we consider the network revenuemanagement problem with no-shows and overbooking, where the show-up probabilities are specificto each product. No-show rates differ significantly by product (for instance, each itinerary andfare combination for an airline) as sale restrictions and the demand characteristics vary byproduct. However, models that consider no-show rates by each individual product are difficultto handle as the state-space in dynamic programming formulations (or the variable space inapproximations) increases significantly. In this paper, we propose a randomized linear program tojointly make the capacity control and overbooking decisions with product-specific no-shows. Weestablish that our formulation gives an upper bound on the optimal expected total profit andour upper bound is tighter than a deterministic linear programming upper bound that appearsin the existing literature. Furthermore, we show that our upper bound is asymptotically tightin a regime where the leg capacities and the expected demand is scaled linearly with the samerate. We also describe how the randomized linear program can be used to obtain a bid price controlpolicy. Computational experiments indicate that our approach is quite fast, able to scale to industrialproblems and can provide significant improvements over standard benchmarks.

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.