Stereotypes of Age Differences in Personality Traits: Universal and Accurate?

Age trajectories for personality traits are known to be similar across cultures. To address whether stereotypes of age groups reflect these age-related changes in personality, we asked participants in 26 countries (N = 3,323) to rate typical adolescents, adults, and old persons in their own country. Raters across nations tended to share similar beliefs about different age groups; adolescents were seen as impulsive, rebellious, undisciplined, preferring excitement and novelty, whereas old people were consistently considered lower on impulsivity, activity, antagonism, and Openness. These consensual age group stereotypes correlated strongly with published age differences on the five major dimensions of personality and most of 30 specific traits, using as criteria of accuracy both self-reports and observer ratings, different survey methodologies, and data from up to 50 nations. However, personal stereotypes were considerably less accurate, and consensual stereotypes tended to exaggerate differences across age groups.

A universal measure of chaotropicity and kosmotropicity

Diverse parameters, including chaotropicity, can limit the function of cellular systems and thereby determine the extent of Earth's biosphere. Whereas parameters such as temperature, hydrophobicity, pressure, pH, Hofmeister effects, and water activity can be quantified via standard scales of measurement, the chao-/kosmotropic activities of environmentally ubiquitous substances have no widely accepted, universal scale. We developed an assay to determine and quantify chao-/kosmotropicity for 97 chemically diverse substances that can be universally applied to all solutes. This scale is numerically continuous for the solutes assayed (from +361kJkg^-1mol^-1 for chaotropes to -659kJkg^-1mol^-1 for kosmotropes) but there are key points that delineate (i) chaotropic from kosmotropic substances (i.e. chaotropes =+4; kosmotropes =-4kJkg^-1mol^-1); and (ii) chaotropic solutes that are readily water-soluble (log P<1.9) from hydrophobic substances that exert their chaotropic activity, by proxy, from within the hydrophobic domains of macromolecular systems (log P>1.9). Examples of chao-/kosmotropicity values are, for chaotropes: phenol +143, CaCl₂ +92.2, MgCl₂ +54.0, butanol +37.4, guanidine hydrochloride +31.9, urea +16.6, glycerol [>6.5M] +6.34, ethanol +5.93, fructose +4.56; for kosmotropes: proline -5.76, sucrose -6.92, dimethylsulphoxide (DMSO) -9.72, mannitol -6.69, trehalose -10.6, NaCl -11.0, glycine -14.2, ammonium sulfate -66.9, polyethylene glycol- (PEG-)1000 -126; and for relatively neutral solutes: methanol, +3.12, ethylene glycol +1.66, glucose +1.19, glycerol [<5M] +1.06, maltose -1.43 (kJkg^-1mol^-1). The data obtained correlate with solute interactions with, and structure-function changes in, enzymes and membranes. We discuss the implications for diverse fields including microbial ecology, biotechnology and astrobiology.

Internal limiting membrane peeling versus no peeling for idiopathic full-thickness macular hole: A pragmatic randomized controlled trial

PURPOSE. To determine whether internal limiting membrane (ILM) peeling is effective and cost effective compared with no peeling in patients with idiopathic stage 2 or 3 full-thickness maculay hole (FTMH). METHODS. This was a pragmatic multicenter randomized controlled trial. Eligible participants from nine centers were randomized to ILM peeling or no peeling (1:1 ratio) in addition to phacovitrectomy, including detachment and removal of the posterior hyaloid and gas tamponade. The primary outcome was distance visual acuity (VA) at 6 months after surgery. Secondary outcomes included hole closure, distance VA at other time points, near VA, contrast sensitivity, reading speed, reoperations, complications, resource use, and participant-reported health status, visual function, and costs. RESULTS. Of 141 participants randomized in nine centers, 127 (90%) completed the 6-month follow-up. Nonstatistically significant differences in distance visual acuity at 6 months were found between groups (mean difference, 4.8; 95% confidence interval [CI], -0.3 to 9.8; P = 0.063). There was a significantly higher rate of hole closure in the ILM-peel group (56 [84%] vs. 31 [48%]) at 1 month (odds ratio [OR], 6.23; 95% CI, 2.64-14.73; P <0.001) with fewer reoperations (8 [12%] vs. 31 [48%]) performed by 6 months (OR, 0.14; 95% CI, 0.05- 0.34; P <0.001). Peeling the ILM is likely to be cost effective. CONCLUSIONS. There was no evidence of a difference in distance VA after the ILM peeling and no-ILM peeling techniques. An important benefit in favor of no ILM peeling was ruled out. Given the higher anatomic closure and lower reoperation rates in the ILM-peel group, ILM peeling seems to be the treatment of choice for idiopathic stage 2 to 3 FTMH. © 2011 The Association for Research in Vision and Ophthalmology, Inc.

Universal behaviour of shock precursors in the presence of efficient cosmic ray acceleration

The self-consistent interaction between energetic particles and self-generated hydromagnetic waves in a cosmic ray pressure dominated plasma is considered. Using a three-dimensional hybrid magnetohydrodynamics (MHD)-kinetic code, which utilizes a spherical harmonic expansion of the Vlasov-Fokker-Planck equation, high-resolution simulations of the magnetic field growth including feedback on the cosmic rays are carried out. It is found that for shocks with high cosmic ray acceleration efficiency, the magnetic fields become highly disorganized, resulting in near isotropic diffusion, independent of the initial orientation of the ambient magnetic field. The possibility of sub-Bohm diffusion is demonstrated for parallel shocks, while the diffusion coefficient approaches the Bohm limit from below for oblique shocks. This universal behaviour suggests that Bohm diffusion in the root-mean-squared field inferred from observation may provide a realistic estimate for the maximum energy acceleration time-scale in young supernova remnants. Although disordered, the magnetic field is not self-similar suggesting a non-uniform energy-dependent behaviour of the energetic particle transport in the precursor. Possible indirect radiative signatures of cosmic ray driven magnetic field amplification are discussed.

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.

Universal tight binding model for chemical reactions in solution and at surfaces. II. Water

A revised water model intended for use in condensed phase simulations in the framework of the self consistent polarizable ion tight binding theory is constructed. The model is applied to water monomer, dimer, hexamers, ice, and liquid, where it demonstrates good agreement with theoretical results obtained by more accurate methods, such as DFT and CCSD(T), and with experiment. In particular, the temperature dependence of the self diffusion coefficient in liquid water predicted by the model, closely reproduces experimental curves in the temperature interval between 230 K and 350 K. In addition, and in contrast to standard DFT, the model properly orders the relative densities of liquid water and ice. A notable, but inevitable, shortcoming of the model is underestimation of the static dielectric constant by a factor of two. We demonstrate that the description of inter and intramolecular forces embodied in the tight binding approximation in quantum mechanics leads to a number of valuable insights which can be missing from ab initio quantum chemistry and classical force fields. These include a discussion of the origin of the enhanced molecular electric dipole moment in the condensed phases, and a detailed explanation for the increase of coordination number in liquid water as a function of temperature and compared with ice-leading to insights into the anomalous expansion on freezing. The theory holds out the prospect of an understanding of the currently unexplained density maximum of water near the freezing point. 

Universal tight binding model for chemical reactions in solution and at surfaces. III. Stoichiometric and reduced surfaces of titania and the adsorption of water

We demonstrate a model for stoichiometric and reduced titanium dioxide intended for use in molecular dynamics and other atomistic simulations and based in the polarizable ion tight binding theory. This extends the model introduced in two previous papers from molecular and liquid applications into the solid state, thus completing the task of providing a comprehensive and unified scheme for studying chemical reactions, particularly aimed at problems in catalysis and electrochemistry. As before, experimental results are given priority over theoretical ones in selecting targets for model fitting, for which we used crystal parameters and band gaps of titania bulk polymorphs, rutile and anatase. The model is applied to six low index titania surfaces, with and without oxygen vacancies and adsorbed water molecules, both in dissociated and non-dissociated states. Finally, we present the results of molecular dynamics simulation of an anatase cluster with a number of adsorbed water molecules and discuss the role of edge and corner atoms of the cluster. (C) 2014 AIP Publishing LLC.

Universal tight binding model for chemical reactions in solution and at surfaces. I. Organic molecules

As is now well established, a first order expansion of the Hohenberg-Kohn total energy density functional about a trial input density, namely, the Harris-Foulkes functional, can be used to rationalize a non self consistent tight binding model. If the expansion is taken to second order then the energy and electron density matrix need to be calculated self consistently and from this functional one can derive a charge self consistent tight binding theory. In this paper we have used this to describe a polarizable ion tight binding model which has the benefit of treating charge transfer in point multipoles. This admits a ready description of ionic polarizability and crystal field splitting. It is necessary in constructing such a model to find a number of parameters that mimic their more exact counterparts in the density functional theory. We describe in detail how this is done using a combination of intuition, exact analytical fitting, and a genetic optimization algorithm. Having obtained model parameters we show that this constitutes a transferable scheme that can be applied rather universally to small and medium sized organic molecules. We have shown that the model gives a good account of static structural and dynamic vibrational properties of a library of molecules, and finally we demonstrate the model's capability by showing a real time simulation of an enolization reaction in aqueous solution. In two subsequent papers, we show that the model is a great deal more general in that it will describe solvents and solid substrates and that therefore we have created a self consistent quantum mechanical scheme that may be applied to simulations in heterogeneous catalysis.

Legalizing physician-assisted suicide and/or euthanasia: Pragmatic implications

Objective: Despite the availability of palliative care in many countries, legalization of euthanasia and physician-assisted suicide (EAS) continues to be debated-particularly around ethical and legal issues-and the surrounding controversy shows no signs of abating. Responding to EAS requests is considered one of the most difficult healthcare responsibilities. In the present paper, we highlight some of the less frequently discussed practical implications for palliative care provision if EAS were to be legalized. Our aim was not to take an explicit anti-EAS stance or expand on findings from systematic reviews or philosophical and ethico-legal treatises, but rather to offer clinical perspectives and the potential pragmatic implications of legalized EAS for palliative care provision, patients and families, healthcare professionals, and the broader community.

Method: We provide insights from our multidisciplinary clinical experience, coupled with those from various jurisdictions where EAS is, or has been, legalized.

Results: We believe that these issues, many of which are encountered at the bedside, must be considered in detail so that the pragmatic implications of EAS can be comprehensively considered.

Significance of Results: Increased resources and effort must be directed toward training, research, community engagement, and ensuring adequate resourcing for palliative care before further consideration is given to allocating resources for legalizing euthanasia and physician-assisted suicide.

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 article 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. In particular, the seemingly obvious lower bounds of Ω(m) messages, where m is the number of edges in the network, and Ω(D) time, where D is the network diameter, are nontrivial to show for randomized (Monte Carlo) algorithms. (Recent results, showing that even Ω(n), where 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 restricted case of comparison algorithms, where it was also required that nodes may not wake up spontaneously and that D and n were not known. We establish these fundamental lower bounds in this article 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 (namely, algorithms that 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 any use of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time leader election algorithm is known. A slight adaptation of our lower bound technique gives rise to an Ω(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 tradeoff messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.