Differential Priors for Elastic Nets

The elastic net and related algorithms, such as generative topographic mapping, are key methods for discretized dimension-reduction problems. At their heart are priors that specify the expected topological and geometric properties of the maps. However, up to now, only a very small subset of possible priors has been considered. Here we study a much more general family originating from discrete, high-order derivative operators. We show theoretically that the form of the discrete approximation to the derivative used has a crucial influence on the resulting map. Using a new and more powerful iterative elastic net algorithm, we confirm these results empirically, and illustrate how different priors affect the form of simulated ocular dominance columns.

Combining influence maps and cellular automata for reactive game agents

Agents make up an important part of game worlds, ranging from the characters and monsters that live in the world to the armies that the player controls. Despite their importance, agents in current games rarely display an awareness of their environment or react appropriately, which severely detracts from the believability of the game. Some games have included agents with a basic awareness of other agents, but they are still unaware of important game events or environmental conditions. This paper presents an agent design we have developed, which combines cellular automata for environmental modeling with influence maps for agent decision-making. The agents were implemented into a 3D game environment we have developed, the EmerGEnT system, and tuned through three experiments. The result is simple, flexible game agents that are able to respond to natural phenomena (e.g. rain or fire), while pursuing a goal.

Multiscale histograms: Summarizing topological relations in large spatial datasets

Summarizing topological relations is fundamental to many spatial applications including spatial query optimization. In this paper, we present several novel techniques to eectively construct cell density based spatial histograms for range (window) summarizations restricted to the four most important topological relations: contains, contained, overlap, and disjoint. We rst present a novel framework to construct a multiscale histogram composed of multiple Euler histograms with the guarantee of the exact summarization results for aligned windows in constant time. Then we present an approximate algorithm, with the approximate ratio 19/12, to minimize the storage spaces of such multiscale Euler histograms, although the problem is generally NP-hard. To conform to a limited storage space where only k Euler histograms are allowed, an effective algorithm is presented to construct multiscale histograms to achieve high accuracy. Finally, we present a new approximate algorithm to query an Euler histogram that cannot guarantee the exact answers; it runs in constant time. Our extensive experiments against both synthetic and real world datasets demonstrated that the approximate mul- tiscale histogram techniques may improve the accuracy of the existing techniques by several orders of magnitude while retaining the cost effciency, and the exact multiscale histogram technique requires only a storage space linearly proportional to the number of cells for the real datasets.

Dynamics and topographic organization of recursive self-organizing maps

Recently there has been an outburst of interest in extending topographic maps of vectorial data to more general data structures, such as sequences or trees. However, there is no general consensus as to how best to process sequences using topographicmaps, and this topic remains an active focus of neurocomputational research. The representational capabilities and internal representations of the models are not well understood. Here, we rigorously analyze a generalization of the self-organizingmap (SOM) for processing sequential data, recursive SOM (RecSOM) (Voegtlin, 2002), as a nonautonomous dynamical system consisting of a set of fixed input maps. We argue that contractive fixed-input maps are likely to produce Markovian organizations of receptive fields on the RecSOM map. We derive bounds on parameter β (weighting the importance of importing past information when processing sequences) under which contractiveness of the fixed-input maps is guaranteed. Some generalizations of SOM contain a dynamic module responsible for processing temporal contexts as an integral part of the model. We show that Markovian topographic maps of sequential data can be produced using a simple fixed (nonadaptable) dynamic module externally feeding a standard topographic model designed to process static vectorial data of fixed dimensionality (e.g., SOM). However, by allowing trainable feedback connections, one can obtain Markovian maps with superior memory depth and topography preservation. We elaborate on the importance of non-Markovian organizations in topographic maps of sequential data. © 2006 Massachusetts Institute of Technology.

"Magic" dispersion maps with distributed Raman amplification

We analyze pulse propagation in an optical fiber with a periodic dispersion map and distributed amplification. Using an asymptotic theory and a momentum method, we identify a family of dispersion management schemes that are advantageous for massive multichannel soliton transmission. For the case of two-step dispersion maps with distributed Raman amplification to compensate for the fiber loss, we find special schemes that have optimal (chirp-free) launch point locations that are independent of the fiber dispersion. Despite the variation of dispersion with wavelength due to the fiber dispersion slope, the transmission in several different channels can be optimized simultaneously using the same optimal launch point. The theoretical predictions are verified by direct numerical simulations. The obtained results are applied to a practical multichannel transmission system.

Optimal dispersion maps for multichannel soliton transmission with distributed Raman amplification

Using an asymptotic theory and a momentum method, we identify a family of dispersion management schemes with distributed Raman amplification, which are advantageous for massive multichannel soliton transmission. For the case of two-step dispersion maps, special schemes are found that have optimal (chirp-free) launch point locations that are independent of the fibre dispersion. Despite the variation of dispersion with wavelength due to the fibre dispersion slope, the transmission in several different channels can be optimized simultaneously using the same optimal launch point. The theoretical results are verified by direct numerical simulations.

True chemical shift correlation maps:a TOCSY experiment with pure shifts in both dimensions

Signal resolution in H NMR is limited primarily by multiplet structure. Recent advances in pure shift NMR, in which the effects of homonuclear couplings are suppressed, have allowed this limitation to be circumvented in 1D NMR, gaining almost an order of magnitude in spectral resolution. Here for the first time an experiment is demonstrated that suppresses multiplet structure in both domains of a homonuclear two-dimensional spectrum. The principle is demonstrated for the TOCSY experiment, generating a chemical shift correlation map in which a single peak is seen for each coupled relationship, but the principle is general and readily extensible to other homonuclear correlation experiments. Such spectra greatly simplify manual spectral analysis and should be well-suited to automated methods for structure elucidation. © 2010 American Chemical Society.

Clustering epileptiform discharges in the interictal electroencephalogram with topography preserving maps

DUE TO COPYRIGHT RESTRICTIONS ONLY AVAILABLE FOR CONSULTATION AT ASTON UNIVERSITY LIBRARY AND INFORMATION SERVICES WITH PRIOR ARRANGEMENT

Topological versus chemical ordering in network glasses at intermediate and extended length scales

Atomic ordering in network glasses on length scales longer than nearest-neighbour length scales has long been a source of controversy(1-6). Detailed experimental information is therefore necessary to understand both the network properties and the fundamentals of glass formation. Here we address the problem by investigating topological and chemical ordering in structurally disordered AX2 systems by applying the method of isotopic substitution in neutron diffraction to glassy ZnCl2. This system may be regarded as a prototypical ionic network forming glass, provided that ion polarization effects are taken into account(7), and has thus been the focus of much attention(8-14). By experiment, we show that both the topological and chemical ordering are described by two length scales at distances greater than nearest-neighbour length scales. One of these is associated with the intermediate range, as manifested by the appearance in the measured diffraction patterns of a first sharp diffraction peak at 1.09( 3) angstrom(-1); the other is associated with an extended range, which shows ordering in the glass out to 62( 4) angstrom. We also find that these general features are characteristic of glassy GeSe2, a prototypical covalently bonded network material(15,16). The results therefore offer structural insight into those length scales that determine many important aspects of supercooled liquid and glass phenomenology(11).

The Interval [0,1] Admits no Functorial Embedding into a Finite-Dimensional or Metrizable Topological Group

An embedding X ⊂ G of a topological space X into a topological group G is called functorial if every homeomorphism of X extends to a continuous group homomorphism of G. It is shown that the interval [0, 1] admits no functorial embedding into a finite-dimensional or metrizable topological group.