Regular dessins with a given automorphism group

Dessins d'enfants are combinatorial structures on compact Riemann surfaces defined over algebraic number fields, and regular dessins are the most symmetric of them. If G is a finite group, there are only finitely many regular dessins with automorphism group G. It is shown how to enumerate them, how to represent them all as quotients of a single regular dessin U(G), and how certain hypermap operations act on them. For example, if G is a cyclic group of order n then U(G) is a map on the Fermat curve of degree n and genus (n-1)(n-2)/2. On the other hand, if G=A_5 then U(G) has genus 274218830047232000000000000000001. For other non-abelian finite simple groups, the genus is much larger.Comment: 19 page

Primitive permutation groups containing a cycle

The primitive finite permutation groups containing a cycle are classified. Of these, only the alternating and symmetric groups contain a cycle fixing at least three points. The contributions of Jordan and Marggraff to this topic are briefly discussed.Comment: 6 page

Challenges and opportunities of context-aware information access

Ubiquitous computing environments embedding a wide range of pervasive computing technologies provide a challenging and exciting new domain for information access. Individuals working in these environments are increasingly permanently connected to rich information resources. An appealing opportunity of these environments is the potential to deliver useful information to individuals either from their previous information experiences or external sources. This information should enrich their life experiences or make them more effective in their endeavours. Information access in ubiquitous computing environments can be made "context-aware" by exploiting the wide range context data available describing the environment, the searcher and the information itself. Realizing such a vision of reliable, timely and appropriate identification and delivery of information in this way poses numerous challenges. A central theme in achieving context-aware information access is the combination of information retrieval with multiple dimensions of available context data. Potential context data sources, include the user's current task, inputs from environmental and biometric sensors, associated with the user's current context, previous contexts, and document context, which can be exploited using a variety of technologies to create new and exciting possibilities for information access

Unstable maps

A map which is non-orientable or has non-empty boundary has a canonical double cover which is orientable and has empty boundary. The map is called stable if every automorphism of this cover is a lift of an automorphism of the map. This note describes several infinite families of unstable maps, and relates them to similar phenomena for graphs, hypermaps and Klein surfaces.Comment: 11 pages, 4 figure