'The Arbitrarium' and 'The Universal Key' (short stories)

Short stories

Computational Verification of Two Universal Relations for Simple Ionic Liquids. Kinetic Properties of a Model 2:1 Molten Salt

Two semianalytical relations [Nature, 1996, 381, 137 and Phys. Rev. Lett. 2001, 87, 245901] predicting dynamical coefficients of simple liquids on the basis of structural properties have been tested by extensive molecular dynamics simulations for an idealized 2:1 model molten salt. In agreement with previous simulation studies, our results support the validity of the relation expressing the self-diffusion coefficient as a Function of the radial distribution functions for all thermodynamic conditions such that the system is in the ionic (ie., fully dissociated) liquid state. Deviations are apparent for high-density samples in the amorphous state and in the low-density, low-temperature range, when ions condense into AB(2) molecules. A similar relation predicting the ionic conductivity is only partially validated by our data. The simulation results, covering 210 distinct thermodynamic states, represent an extended database to tune and validate semianalytical theories of dynamical properties and provide a baseline for the interpretation of properties of more complex systems such as the room-temperature ionic liquids.

Structural similarity of directed universal hierarchical graphs: A low computational complexity approach

In the present paper we mainly introduce an efficient approach to measure the structural similarity of so called directed universal hierarchical graphs. We want to underline that directed universal hierarchical graphs can be obtained from generalized trees which are already introduced. In order to classify these graphs, we state our novel graph similarity method. As a main result we notice that our novel algorithm has low computational complexity. (c) 2007 Elsevier Inc. All rights reserved.

Europe’s Information Society project and Digital Inclusion: universal service obligations or social solidarity?

The importance of digital inclusion to Europe is obvious: as we move towards an ever more internet-communicating society the lack of access to basic digital infrastructures for a significant segment of the population is both problematic for those individuals without access and also problematic for those providing services which should be efficient and fully utilised. The EU’s ‘Information Society’ project has been the central plank of the European attempt to build a European digital marketplace, a concept which necessitates digital inclusion of the population at large. It is a project which prefers universal service obligations to achieve inclusion. If that is to be the preferred solution I suggest that we must consider exclusion from the banking system, given that the Information Society is at root an economic community.

However, universal service obligations are not the only method whereby digital inclusion can be encouraged and I posit we may need to reconsider the role of the state as supplier of services through the concept of ‘social solidarity’.

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.

Inventing the Origin of Theatre History: The Modern Uses of Juba II's 'teatriké historia'

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.