Here, we describe the potential utility of the card sorting method for structuring and refining map symbol sets. Card sorting has been proposed as a method for delineating categories by researchers and practitioners in a variety of disciplines due to its ability to identify and explicate real or perceived structures in an information space; however, there is little reported application of card ...

Geographic information is commonly disseminated and consumed via visual representations of features and their environmental context on maps. Map design inherently involves generalizing reality, and one method by which mapmakers do so is through the use of symbols to represent features. Here we focus on the challenges associated with supporting mapmakers who need to work together to reach consen...

Starting from the concept of the universal exterior algebra in non-commutative differential geometry we construct differential forms on the quantum phase-space of an arbitrary system. They bear the same natural relationship to quantum dynamics which ordinary tensor fields have with respect to classical hamiltonian dynamics.

In this paper, a novel maximum a posteriori (MAP) technique for the decoding of arithmetic codes in the presence of transmission errors is presented. Arithmetic codes with a forbidden symbol and trellis search techniques are employed in order to estimate the best transmitted codeword. The viability of the proposed approach is demonstrated in the binary symmetric channel case in terms of both pe...

In this work an online algorithm is presented for the construction of the self-organizing map (SOM) of symbol strings. Each node of the SOM grid is associated with a model string which is a variable-vector sequence. Smooth interpolation method is applied in the training which performs simultaneous adaptation of the symbol content and the length of the model string. The efficiency of the method ...

In this work, we derive the maximum a posteriori (MAP) symbol detector for a multiple-input multiple-output system in the presence of Wiener phase noise due to noisy local oscillators. As in single-antenna systems, the computation of the optimal receiver is an infinite dimensional problem and is thus unimplementable in practice. In this purview, we propose three suboptimal, low-complexity algor...

Recently, binary sequences generated by chaotic maps have been widely studied. In particular, the logistic map is used as one of the chaotic map. However, if the logistic map is implemented by using finite precision computer arithmetic, rounding is required. In order to avoid rounding, Miyazaki, Araki, Uehara and Nogami proposed the logistic map over finite fields, and show some properties of s...

(n) (x) · v). The map F is called a linear cocycle. Fix some norm ·· on R d , and use the same symbol to indicate the induced operator norm.

We show that there is a canonical, order preserving map ψ of lattices of subgroups, which maps the lattice Sub(A) of subgroups of the ideal class group of a galois number field K into the lattice Sub(H/K) of subfields of the Hilbert class field. Furthermore, this map is a capitulation map in the sense that all the primes in the classes of A ⊂ A capitulate in ψ(A). In particular we have a new, s...

Research conducted on the theory of selective attention suggests that varying the graphic combinations used when designing bivariate symbols affects the functionality of the symbol. Some graphic combinations appear to facilitate the ability to visualize correlation between the data sets represented by the symbol; others appear to be more effective at representing the data sets individually, som...