Thermal conductivity of gaseous and liquid hydrogen

Normal and para-hydrogen conductivity measurements at temperatures from 200 to 17 deg K, at densities up to 2.6 times critical density, and at pressures to 15 MN/sq m are made. Using new calorimeter, data are analyzed as functions of density at fixed temperatures and of temperature at fixed densitie

Safeguards in financing the purchase of a farm

"February, 1942

Improving Collaborative Convergence through Distributed and Parallel Sorting

This paper examines a convergence process of organizing ideas that are generated during collaborative idea generation activities. The method presented reduces the impact of organizing brainstorming ideas on individual participants by dividing the convergence activity into smaller, discrete tasks that can be completed individually, and in parallel, by the participants. The entire pool of brainstorming ideas is subdivided into smaller pools and each participant is then tasked with organizing one of the subsets of ideas. The results show that by dividing up the overall activity into subtasks, the subjects experienced a more favorable environment. Furthermore, the subjects were able to work through their subset of ideas and produce results that were similar to those performing the full sort of the entire pool

Algebraic entropy and the space of initial values for discrete dynamical systems

A method to calculate the algebraic entropy of a mapping which can be lifted to an isomorphism of a suitable rational surfaces (the space of initial values) are presented. It is shown that the degree of the $n$th iterate of such a mapping is given by its action on the Picard group of the space of initial values. It is also shown that the degree of the $n$th iterate of every Painlev\'e equation in sakai's list is at most $O(n^2)$ and therefore its algebraic entropy is zero.Comment: 10 pages, pLatex fil

On the complexity of some birational transformations

Using three different approaches, we analyze the complexity of various birational maps constructed from simple operations (inversions) on square matrices of arbitrary size. The first approach consists in the study of the images of lines, and relies mainly on univariate polynomial algebra, the second approach is a singularity analysis, and the third method is more numerical, using integer arithmetics. Each method has its own domain of application, but they give corroborating results, and lead us to a conjecture on the complexity of a class of maps constructed from matrix inversions