Evocative computing – creating meaningful lasting experiences in connecting with the past

We present an approach – evocative computing – that demonstrates how ‘at hand’ technologies can be ‘picked up’ and used by people to create meaningful and lasting experiences, through connecting and interacting with the past. The approach is instantiated here through a suite of interactive technologies configured for an indoor-outdoor setting that enables groups to explore, discover and research the history and background of a public cemetery. We report on a two-part study where different groups visited the cemetery and interacted with the digital tools and resources. During their activities serendipitous uses of the technology led to connections being made between personal memo-ries and ongoing activities. Furthermore, these experiences were found to be long-lasting; a follow-up study, one year later, showed them to be highly memorable, and in some cases leading participants to take up new directions in their work. We discuss the value of evocative computing for enriching user experiences and engagement with heritage practices

On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms

Uniquely closable skeletons of lambda terms are Motzkin-trees that predetermine the unique closed lambda term that can be obtained by labeling their leaves with de Bruijn indices. Likewise, uniquely typable skeletons of closed lambda terms predetermine the unique simply-typed lambda term that can be obtained by labeling their leaves with de Bruijn indices. We derive, through a sequence of logic program transformations, efficient code for their combinatorial generation and study their statistical properties. As a result, we obtain context-free grammars describing closable and uniquely closable skeletons of lambda terms, opening the door for their in-depth study with tools from analytic combinatorics. Our empirical study of the more difficult case of (uniquely) typable terms reveals some interesting open problems about their density and asymptotic behavior. As a connection between the two classes of terms, we also show that uniquely typable closed lambda term skeletons of size $3n+1$ are in a bijection with binary trees of size $n$.Comment: Pre-proceedings paper presented at the 27th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2017), Namur, Belgium, 10-12 October 2017 (arXiv:1708.07854

Limit-(quasi)periodic point sets as quasicrystals with p-adic internal spaces

Model sets (or cut and project sets) provide a familiar and commonly used method of constructing and studying nonperiodic point sets. Here we extend this method to situations where the internal spaces are no longer Euclidean, but instead spaces with p-adic topologies or even with mixed Euclidean/p-adic topologies. We show that a number of well known tilings precisely fit this form, including the chair tiling and the Robinson square tilings. Thus the scope of the cut and project formalism is considerably larger than is usually supposed. Applying the powerful consequences of model sets we derive the diffractive nature of these tilings.Comment: 11 pages, 2 figures; dedicated to Peter Kramer on the occasion of his 65th birthda

Extraneous Background-Correction Program for Matrix Bound Multiple Point X-Ray Microanalysis

A program is described that allows online determination of extraneous background in multiple point X-ray microanalytical matrices. The program is based upon the calculations of the extraneous background for the film (when present), the standard and the unknown by (100 sec.) point analysis. The program searches for a peak-free part of the spectrum in which the calculated value for the extraneous background is about equal to the value in this region of the spectrum (=be). Online the contents of this be-region is subtracted from an unmanipulated continuum region in the vicinity of the element present in the unknown and standard (Pt). During the subsequently performed matrix analysis two arrays are acquired (P-b) and (b-be). From these two arrays, the Rx,st and subsequently the Rx,sp are calculated per pixel, which are converted to (be corrected) concentration arrays. In addition Z2/A-differences between standard and the analyzed specimen are corrected off-line. For each pixel the program judges whether the calculated concentration deviates from the value introduced for the standard. Once differences are registered, adequate corrections are made

Finite-lattice expansion for Ising models on quasiperiodic tilings

Low-temperature series are calculated for the free energy, magnetisation, susceptibility and field-derivatives of the susceptibility in the Ising model on the quasiperiodic Penrose lattice. The series are computed to order 20 and estimates of the critical exponents alpha, beta and gamma are obtained from Pade approximants.Comment: 16 pages, REVTeX, 26 postscript figure

Gait stability at early stages of multiple sclerosis using different data sources

Background: People at early stages of multiple sclerosis have subtle balance problems that may affect gait stability. However, differences in methods of determining stability such as sensor type and placements, may lead to different results and affect their interpretation when comparing to controls and other studies. Questions: Do people with multiple sclerosis (PwMS) exhibit lower gait stability? Do location and type of data used to calculate stability metrics affect comparisons? Methods: 30 PwMS with no walking impairments as clinically measured and 15 healthy controls walked on a treadmill at 1.2 ms−1 while 3D acceleration data was obtained from sacrum, shoulder and cervical markers and from an accelerometer placed at the sacrum. The local divergence exponent was calculated for the four data sources. An ANOVA with group (multiple sclerosis and control) and data source as main factors was used to determine the effect of disease, data source and their interaction on stability metrics. Results: PwMS walked with significantly less stability according to all sensors (no interaction). A significant effect of data source on stability was also found, indicating that the local divergence exponent derived from sacrum accelerometer was lower than that derived from the other 3 sensor locations. Significance: PwMS with no evident gait impairments are less stable than healthy controls when walking on a treadmill. Although different data sources can be used to determine MS-related stability deterioration, a consensus about location and data source is needed. The local divergence exponent can be a useful measure of progression of gait instability at early stages of MS

Analytical probabilistic approach to the ground state of lattice quantum systems: exact results in terms of a cumulant expansion

We present a large deviation analysis of a recently proposed probabilistic approach to the study of the ground-state properties of lattice quantum systems. The ground-state energy, as well as the correlation functions in the ground state, are exactly determined as a series expansion in the cumulants of the multiplicities of the potential and hopping energies assumed by the system during its long-time evolution. Once these cumulants are known, even at a finite order, our approach provides the ground state analytically as a function of the Hamiltonian parameters. A scenario of possible applications of this analyticity property is discussed.Comment: 26 pages, 5 figure

Laws relating runs, long runs, and steps in gambler's ruin, with persistence in two strata

Define a certain gambler's ruin process \mathbf{X}_{j}, \mbox{ \ }j\ge 0, such that the increments $\varepsilon_{j}:=\mathbf{X}_{j}-\mathbf{X}_{j-1}$ take values $\pm1$ and satisfy $P(\varepsilon_{j+1}=1|\varepsilon_{j}=1, |\mathbf{X}_{j}|=k)=P(\varepsilon_{j+1}=-1|\varepsilon_{j}=-1,|\mathbf{X}_{j}|=k)=a_k$, all $j\ge 1$, where $a_k=a$ if $0\le k\le f-1$, and $a_k=b$ if $f\le k<N$. Here $0<a, b <1$ denote persistence parameters and $f ,N\in \mathbb{N}$ with $f<N$. The process starts at $\mathbf{X}_0=m\in (-N,N)$ and terminates when $|\mathbf{X}_j|=N$. Denote by ${\cal R}'_N$, ${\cal U}'_N$, and ${\cal L}'_N$, respectively, the numbers of runs, long runs, and steps in the meander portion of the gambler's ruin process. Define $X_N:=\left ({\cal L}'_N-\frac{1-a-b}{(1-a)(1-b)}{\cal R}'_N-\frac{1}{(1-a)(1-b)}{\cal U}'_N\right )/N$ and let $f\sim\eta N$ for some $0<\eta <1$. We show $\lim_{N\to\infty} E\{e^{itX_N}\}=\hat{\varphi}(t)$ exists in an explicit form. We obtain a companion theorem for the last visit portion of the gambler's ruin.Comment: Presented at 8th International Conference on Lattice Path Combinatorics, Cal Poly Pomona, Aug., 2015. The 2nd version has been streamlined, with references added, including reference to a companion document with details of calculations via Mathematica. The 3rd version has 2 new figures and improved presentatio

Generalized Riemann sums

The primary aim of this chapter is, commemorating the 150th anniversary of Riemann's death, to explain how the idea of {\it Riemann sum} is linked to other branches of mathematics. The materials I treat are more or less classical and elementary, thus available to the "common mathematician in the streets." However one may still see here interesting inter-connection and cohesiveness in mathematics