Measuring Symbol and Icon Characteristics: Norms for Concreteness, Complexity, Meaningfulness, Familiarity, and Semantic Distance for 239 Symbols

This paper provides rating norms for a set of symbols and icons selected from a wide variety of sources. These ratings enable the effects of symbol characteristics on user performance to be systematically investigated. The symbol characteristics that have been quantified are considered to be of central relevance to symbol usability research and include concreteness, complexity, meaningfulness, familiarity, and semantic distance. The interrelationships between each of these dimensions is examined and the importance of using normative ratings for experimental research is discussed

Quantum dynamics in high codimension tilings: from quasiperiodicity to disorder

We analyze the spreading of wavepackets in two-dimensional quasiperiodic and random tilings as a function of their codimension, i.e. of their topological complexity. In the quasiperiodic case, we show that the diffusion exponent that characterizes the propagation decreases when the codimension increases and goes to 1/2 in the high codimension limit. By constrast, the exponent for the random tilings is independent of their codimension and also equals 1/2. This shows that, in high codimension, the quasiperiodicity is irrelevant and that the topological disorder leads in every case, to a diffusive regime, at least in the time scale investigated here.Comment: 4 pages, 5 EPS figure

Photonic quasicrystals for general purpose nonlinear optical frequency conversion

We present a general method for the design of 2-dimensional nonlinear photonic quasicrystals that can be utilized for the simultaneous phase-matching of arbitrary optical frequency-conversion processes. The proposed scheme--based on the generalized dual-grid method that is used for constructing tiling models of quasicrystals--gives complete design flexibility, removing any constraints imposed by previous approaches. As an example we demonstrate the design of a color fan--a nonlinear photonic quasicrystal whose input is a single wave at frequency $\omega$ and whose output consists of the second, third, and fourth harmonics of $\omega$, each in a different spatial direction

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

Creation and Growth of Components in a Random Hypergraph Process

Denote by an $\ell$-component a connected $b$-uniform hypergraph with $k$ edges and $k(b-1) - \ell$ vertices. We prove that the expected number of creations of $\ell$-component during a random hypergraph process tends to 1 as $\ell$ and $b$ tend to $\infty$ with the total number of vertices $n$ such that $\ell = o(\sqrt[3]{\frac{n}{b}})$. Under the same conditions, we also show that the expected number of vertices that ever belong to an $\ell$-component is approximately $12^{1/3} (b-1)^{1/3} \ell^{1/3} n^{2/3}$. As an immediate consequence, it follows that with high probability the largest $\ell$-component during the process is of size $O((b-1)^{1/3} \ell^{1/3} n^{2/3})$. Our results give insight about the size of giant components inside the phase transition of random hypergraphs.Comment: R\'{e}sum\'{e} \'{e}tend

Fluctuations in the Site Disordered Traveling Salesman Problem

We extend a previous statistical mechanical treatment of the traveling salesman problem by defining a discrete "site disordered'' problem in which fluctuations about saddle points can be computed. The results clarify the basis of our original treatment, and illuminate but do not resolve the difficulties of taking the zero temperature limit to obtain minimal path lengths.Comment: 17 pages, 3 eps figures, revte

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

Bond percolation on isoradial graphs: criticality and universality

In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square, triangular, and other lattices. This is achieved via the star-triangle transformation, by transporting the box-crossing property across the family of isoradial graphs. As a consequence, we obtain the universality of these models at the critical point, in the sense that the one-arm and 2j-alternating-arm critical exponents (and therefore also the connectivity and volume exponents) are constant across the family of such percolation processes. The isoradial graphs in question are those that satisfy certain weak conditions on their embedding and on their track system. This class of graphs includes, for example, isoradial embeddings of periodic graphs, and graphs derived from rhombic Penrose tilings.Comment: In v2: extended title, and small changes in the tex