PickCells: A Physically Reconfigurable Cell-composed Touchscreen

Touchscreens are the predominant medium for interactions with digital services; however, their current fixed form factor narrows the scope for rich physical interactions by limiting interaction possibilities to a single, planar surface. In this paper we introduce the concept of PickCells, a fully reconfigurable device concept composed of cells, that breaks the mould of rigid screens and explores a modular system that affords rich sets of tangible interactions and novel acrossdevice relationships. Through a series of co-design activities – involving HCI experts and potential end-users of such systems – we synthesised a design space aimed at inspiring future research, giving researchers and designers a framework in which to explore modular screen interactions. The design space we propose unifies existing works on modular touch surfaces under a general framework and broadens horizons by opening up unexplored spaces providing new interaction possibilities. In this paper, we present the PickCells concept, a design space of modular touch surfaces, and propose a toolkit for quick scenario prototyping

InfoVis experience enhancement through mediated interaction

Information visualization is an experience in which both the aesthetic representations and interaction are part. Such an experience can be augmented through close consideration of its major components. Interaction is crucial to the experience, yet it has seldom been adequately explored in the field. We claim that direct mediated interaction can augment such an experience. This paper discusses the reasons behind such a claim and proposes a mediated interactive manipulation scheme based on the notion of directness. It also describes the ways in which such a claim will be validated. The Literature Knowledge Domain (LKD) is used as the concrete domain around which the discussions will be held

Ergodic quantum computing

We propose a (theoretical ;-) model for quantum computation where the result can be read out from the time average of the Hamiltonian dynamics of a 2-dimensional crystal on a cylinder. The Hamiltonian is a spatially local interaction among Wigner-Seitz cells containing 6 qubits. The quantum circuit that is simulated is specified by the initialization of program qubits. As in Margolus' Hamiltonian cellular automaton (implementing classical circuits), a propagating wave in a clock register controls asynchronously the application of the gates. However, in our approach all required initializations are basis states. After a while the synchronizing wave is essentially spread around the whole crystal. The circuit is designed such that the result is available with probability about 1/4 despite of the completely undefined computation step. This model reduces quantum computing to preparing basis states for some qubits, waiting, and measuring in the computational basis. Even though it may be unlikely to find our specific Hamiltonian in real solids, it is possible that also more natural interactions allow ergodic quantum computing.Comment: latex, 25 pages, 10 figures (colored

OPERA first events from the CNGS neutrino beam

The aim of the OPERA experiment is to search for the appearance of the tau neutrino in the quasi pure muon neutrino beam produced at CERN (CNGS). The detector, installed in the Gran Sasso underground laboratory 730 km away from CERN, consists of a lead/emulsion target complemented with electronic detectors. A report is given on the detector status (construction, data taking and analysis) and on the first successful 2006 neutrino runs.Comment: 6 pages, 9 figures Proceedings of the XLIInd Rencontres de Moriond session, La Thuile, 10-17 March 200

Implementation and complexity of the watershed-from-markers algorithm computed as a minimal cost forest

The watershed algorithm belongs to classical algorithms in mathematical morphology. Lotufo et al. published a principle of the watershed computation by means of an Image Foresting Transform (IFT), which computes a shortest path forest from given markers. The algorithm itself was described for a 2D case (image) without a detailed discussion of its computation and memory demands for real datasets. As IFT cleverly solves the problem of plateaus and as it gives precise results when thin objects have to be segmented, it is obvious to use this algorithm for 3D datasets taking in mind the minimizing of a higher memory consumption for the 3D case without loosing low asymptotical time complexity of O(m+C) (and also the real computation speed). The main goal of this paper is an implementation of the IFT algorithm with a priority queue with buckets and careful tuning of this implementation to reach as minimal memory consumption as possible. The paper presents five possible modifications and methods of implementation of the IFT algorithm. All presented implementations keep the time complexity of the standard priority queue with buckets but the best one minimizes the costly memory allocation and needs only 19-45% of memory for typical 3D medical imaging datasets. Memory saving was reached by an IFT algorithm simplification, which stores more elements in temporary structures but these elements are simpler and thus need less memory. The best presented modification allows segmentation of large 3D medical datasets (up to 512x512x680 voxels) with 12-or 16-bits per voxel on currently available PC based workstations.Comment: v1: 10 pages, 6 figures, 7 tables EUROGRAPHICS conference, Manchester, UK, 2001. v2: 12 pages, reformated for letter, corrected IFT to "Image Foresting Tranform