Stress processes in caring for an end-of-life family member:Application of a theoretical model

Objectives: Family caregivers play a vital role in maintaining the lives of individuals with advanced illness living in the community. However, the responsibility of caregiving for an end-of-life family member can have profound consequences on the psychological, physical and financial well-being of the caregiver. While the literature has identified caregiver stress or strain as a complex process with multiple contributing factors, few comprehensive studies exist. This study examined a wide range of theory-driven variables contributing to family caregiver stress. Method: Data variables from interviews with primary family caregivers were mapped onto the factors within the Stress Process Model theoretical framework. A hierarchical multiple linear regression analysis was used to determine the strongest predictors of caregiver strain as measured by a validated composite index, the Caregiver Strain Index. Results: The study included 132 family caregivers across south-central/western Ontario, Canada. About half of these caregivers experienced high strain, the extent of which was predicted by lower perceived program accessibility, lower functional social support, greater weekly amount of time caregivers committed to the care recipient, younger caregiver age and poorer caregiver self-perceived health. Conclusion: This study examined the influence of a multitude of factors in the Stress Process Model on family caregiver strain, finding stress to be a multidimensional construct. Perceived program accessibility was the strongest predictor of caregiver strain, more so than intensity of care, highlighting the importance of the availability of community resources to support the family caregiving role.

Investigation of Genetic Variation in Scavenger Receptor Class B, Member 1 (SCARB1) and Association with Serum Carotenoids

Objective: To investigate association of scavenger receptor class B, member 1 (SCARB1) genetic variants with serum carotenoid levels of lutein (L) and zeaxanthin (Z) and macular pigment optical density (MPOD).
Design: A cross-sectional study of healthy adults aged 20 to 70.
Participants: We recruited 302 participants after local advertisement.
Methods: We measured MPOD by customized heterochromatic flicker photometry. Fasting blood samples were taken for serum L and Z measurement by high-performance liquid chromatography and lipoprotein analysis by spectrophotometric assay. Forty-seven single nucleotide polymorphisms (SNPs) across SCARB1 were genotyped using Sequenom technology. Association analyses were performed using PLINK to compare allele and haplotype means, with adjustment for potential confounding and correction for multiple comparisons by permutation testing. Replication analysis was performed in the TwinsUK and Carotenoids in Age-Related Eye Disease Study (CAREDS) cohorts.
Main Outcome Measures: Odds ratios for MPOD area, serum L and Z concentrations associated with genetic variations in SCARB1 and interactions between SCARB1 and gender.
Results: After multiple regression analysis with adjustment for age, body mass index, gender, high-density lipoprotein cholesterol, low-density lipoprotein cholesterol, triglycerides, smoking, and dietary L and Z levels, 5 SNPs were significantly associated with serum L concentration and 1 SNP with MPOD (P<0.01). Only the association between rs11057841 and serum L withstood correction for multiple comparisons by permutation testing (P<0.01) and replicated in the TwinsUK cohort (P = 0.014). Independent replication was also observed in the CAREDS cohort with rs10846744 (P = 2×10-4), an SNP in high linkage disequilibrium with rs11057841 (r2 = 0.93). No interactions by gender were found. Haplotype analysis revealed no stronger association than obtained with single SNP analyses.
Conclusions: Our study has identified association between rs11057841 and serum L concentration (24% increase per T allele) in healthy subjects, independent of potential confounding factors. Our data supports further evaluation of the role for SCARB1 in the transport of macular pigment and the possible modulation of age-related macular degeneration risk through combating the effects of oxidative stress within the retina.
Financial Disclosure(s): Proprietary or commercial disclosures may be found after the references. Ophthalmology 2013;120:1632–1640 © 2013 by the American Academy of Ophthalmology.

A dramatic shift from multiple to simple exchange in the cyclopentane/D-2 probe reaction on palladium catalysts

Electron deficient active sites in Pd catalysts, either as films or on supports, are deliberately generated by calcining in O-2 at high temperature followed by the mildest possible reduction (with the reaction mixture itself), and are manifested by a marked shift from multiple to simple exchange in the cyclopentane/D-2 probe reaction.

Exchange Place

Novel

Neolithic Exchange Networks in the Central Mediterranean:The Neolithic of Europe), (A. Fleming, (ed.).

Malone , C.,. in The World Archaeological Congress, Southampton 1986, Pre Circulated Papers. : Southampton.

Exchange systems and style in the Central Mediterranean. 4500-1700 b.c..:Unpublished PhD. Cambridge University Library

Malone, C.A.T., 1986, Unpublished PhD, Cambridge University, Cambridge.

Voices from higher up the ladder:Exploring the team leader role in call centres

This paper focuses on an under-researched employee category in the call centre literature-the team leader. The paper, drawing on data from nine Australian call centres, finds that the team leader role is integral to the effectiveness of call centres, yet it is a role that consists of considerable complexity and contradictions. The research demonstrates the critical role performed by team leaders: coach, mentor, trainer, performance evaluator, communicator and supervisor. It also shows team leaders as being far more positive about many of the features of the call centre work environment compared with those on the front line. However, there does appear to be a need for greater acknowledgement of their challenging role, the contradictions that are inherent in the job and the need, in many cases, for increased support being made available to assist. © 2013 John Wiley & Sons Ltd.

On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. The "obvious" lower bounds of O(m) messages (m is the number of edges in the network) and O(D) time (D is the network diameter) are non-trivial to show for randomized (Monte Carlo) algorithms. (Recent results that show that even O(n) (n is the number of nodes in the network) is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms (except for the limited case of comparison algorithms, where it was also required that some nodes may not wake up spontaneously, and that D and n were not known).

We establish these fundamental lower bounds in this paper for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (such algorithms should work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make anyuse of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time algorithm is known. A slight adaptation of our lower bound technique gives rise to an O(m) message lower bound for randomized broadcast algorithms.

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. (The answer is known to be negative in the deterministic setting). We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that trade-off messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

Controls on stone temperatures and the benefits of interdisciplinary exchange

Data derived from a series of field and laboratory studies of the influence of albedo and thermal conductivity on stone temperatures are reported. They indicate the complexity of surface/subsurface temperature response characteristics of different stone types exposed to the same conditions and highlight the influence of albedo and thermal conductivity on micro-environmental conditions at the rock/air interface – conditions which have significant implications for the nature and rate of weathering activity and which may, over time, affect any surface treatments applied to stone surfaces. Although the studies reviewed were carried out within the subject area of geomorphology, the data reported and the implications for stone weathering arising from them, may be of some relevance to the conservation science perspective on deterioration of contemporary, historical and archaeological stonework.

Sublinear Bounds for Randomized Leader Election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) takes only O(n-vlog3/2n) messages to elect a unique leader (with high probability). This algorithm is then extended to solve leader election on any connected non-bipartiten-node graph G in O(t(G)) time and O(t(G)n-vlog3/2n) messages, where t(G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficientdeterministic leader election algorithms. Finally, an almost-tight lower bound is presented for randomized leader election, showing that O(n-v) messages are needed for any O(1) time leader election algorithm which succeeds with high probability. It is also shown that O(n 1/3) messages are needed by any leader election algorithm that succeeds with high probability, regardless of the number of the rounds. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.

Sublinear bounds for randomized leader election

This paper concerns randomized leader election in synchronous distributed networks. A distributed leader election algorithm is presented for complete n-node networks that runs in O(1) rounds and (with high probability) uses only O(√ √nlog^3/2n) messages to elect a unique leader (with high probability). When considering the "explicit" variant of leader election where eventually every node knows the identity of the leader, our algorithm yields the asymptotically optimal bounds of O(1) rounds and O(. n) messages. This algorithm is then extended to one solving leader election on any connected non-bipartite n-node graph G in O(τ(. G)) time and O(τ(G)n√log^3/2n) messages, where τ(. G) is the mixing time of a random walk on G. The above result implies highly efficient (sublinear running time and messages) leader election algorithms for networks with small mixing times, such as expanders and hypercubes. In contrast, previous leader election algorithms had at least linear message complexity even in complete graphs. Moreover, super-linear message lower bounds are known for time-efficient deterministic leader election algorithms. Finally, we present an almost matching lower bound for randomized leader election, showing that Ω(n) messages are needed for any leader election algorithm that succeeds with probability at least 1/. e+. ε, for any small constant ε. >. 0. We view our results as a step towards understanding the randomized complexity of leader election in distributed networks.

RuxNb1-xO2 catalyst for the oxygen evolution reaction in proton exchange membrane water electrolysers

Bimetallic catalyst system of ruthenium oxide (RuO) and niobium oxide (NbO) was prepared using the Adams method and the hydrolysis method. Physical and electrochemical characterizations of the catalysts were studied using X-ray diffraction (XRD), Scanning electron microscopy (SEM), cyclic voltammogram (CV) and polarization measurements. NbO addition to RuO was found to increase the stability of RuO. In Adams method the sodium nitrate was found to be forming complex with NbO at high temperature reaction. This makes Adams method unsuitable for the synthesis of RuO -NbO bimetallic system. Hydrolysis method on other hand does not have this problem. But a proper mixture of two oxides was not obtained in hydrolysis method. A lower crystallite size for bimetallic system was obtained with Adams method compared to hydrolysis method. RuO prepared by Adams method had higher activity compared to the hydrolysis counterpart in electrolyzer operation with nafion membrane. A cell voltage of 1.62 V was obtained with RuO (A) at 1 A/cm. A higher stability for RuNbO(A) compared to RuO(A) was observed in continuous cyclic voltammogram and electrolyzer cell test. Copyright © 2013, Hydrogen Energy Publications, LLC. Published by Elsevier Ltd. All rights reserved.

Physical and electrochemical evaluation of ATO supported IrO2 catalyst for proton exchange membrane water electrolyser

Antimony doped tin oxide (ATO) was studied as a support material for IrO₂ in proton exchange membrane water electrolyser (PEMWE). Adams fusion method was used to prepare the IrO₂-ATO catalysts. The physical and electrochemical characterisation of the catalysts were carried out using X-ray diffraction (XRD), scanning electron microscopy (SEM), transmission electron microscopy (TEM), powder conductivity, cyclic voltammetry (CV) and membrane electrode assembly (MEA) polarisation. The BET surface area and electronic conductivity of the supported catalysts were found to be predominantly arisen from the IrO₂. Supported catalyst showed higher active surface area than the pristine IrO₂ in CV analysis with 85% H₃PO₄ as electrolyte. The MEA performance using Nafion®−115 membrane at 80 °C and atmospheric pressure showed a better performance for IrO₂ loading ≥60 wt.% than the pristine IrO₂ with a normalised current density of 1625 mA cm⁻² @1.8 V for the 60% IrO₂-ATO compared to 1341 mA cm⁻² for the pristine IrO₂ under the same condition. The higher performance of the supported catalysts was mainly attributed to better dispersion of active IrO₂ on electrochemically inactive ATO support material, forming smaller IrO₂ crystallites. A 40 wt.% reduction in the IrO₂ was achieved by utilising the support material.