12,103 research outputs found

    Revisiting revisitation in computer interaction: organic bookmark management.

    Get PDF
    According to Milic-Frayling et al. (2004), there are two general ways of user browsing i.e. search (finding a website where the user has never visited before) and revisitation (returning to a website where the user has visited in the past). The issue of search is relevant to search engine technology, whilst revisitation concerns web usage and browser history mechanisms. The support for revisitation is normally through a set of functional built-in icons e.g. History, Back, Forward and Bookmarks. Nevertheless, for returning web users, they normally find it is easier and faster to re-launch an online search again, rather than spending time to find a particular web site from their personal bookmark and history records. Tauscher and Greenberg (1997) showed that revisiting web pages forms up to 58% of the recurrence rate of web browsing. Cockburn and McKenzie (2001) also stated that 81% of web pages have been previously visited by the user. According to Obendorf et al. (2007), revisitation can be divided into four classifications based on time: short-term (72.6% revisits within an hour), medium-term (12% revisits within a day and 7.8% revisits within a week), and long-term (7.6% revisits longer than a week)

    Revisiting the radio interferometer measurement equation. IV. A generalized tensor formalism

    Full text link
    The radio interferometer measurement equation (RIME), especially in its 2x2 form, has provided a comprehensive matrix-based formalism for describing classical radio interferometry and polarimetry, as shown in the previous three papers of this series. However, recent practical and theoretical developments, such as phased array feeds (PAFs), aperture arrays (AAs) and wide-field polarimetry, are exposing limitations of the formalism. This paper aims to develop a more general formalism that can be used to both clearly define the limitations of the matrix RIME, and to describe observational scenarios that lie outside these limitations. Some assumptions underlying the matrix RIME are explicated and analysed in detail. To this purpose, an array correlation matrix (ACM) formalism is explored. This proves of limited use; it is shown that matrix algebra is simply not a sufficiently flexible tool for the job. To overcome these limitations, a more general formalism based on tensors and the Einstein notation is proposed and explored both theoretically, and with a view to practical implementations. The tensor formalism elegantly yields generalized RIMEs describing beamforming, mutual coupling, and wide-field polarimetry in one equation. It is shown that under the explicated assumptions, tensor equations reduce to the 2x2 RIME. From a practical point of view, some methods for implementing tensor equations in an optimal way are proposed and analysed. The tensor RIME is a powerful means of describing observational scenarios not amenable to the matrix RIME. Even in cases where the latter remains applicable, the tensor formalism can be a valuable tool for understanding the limits of such applicability.Comment: 16 pages, no figures, accepted by A&

    Revisiting Matrix Product on Master-Worker Platforms

    Get PDF
    This paper is aimed at designing efficient parallel matrix-product algorithms for heterogeneous master-worker platforms. While matrix-product is well-understood for homogeneous 2D-arrays of processors (e.g., Cannon algorithm and ScaLAPACK outer product algorithm), there are three key hypotheses that render our work original and innovative: - Centralized data. We assume that all matrix files originate from, and must be returned to, the master. - Heterogeneous star-shaped platforms. We target fully heterogeneous platforms, where computational resources have different computing powers. - Limited memory. Because we investigate the parallelization of large problems, we cannot assume that full matrix panels can be stored in the worker memories and re-used for subsequent updates (as in ScaLAPACK). We have devised efficient algorithms for resource selection (deciding which workers to enroll) and communication ordering (both for input and result messages), and we report a set of numerical experiments on various platforms at Ecole Normale Superieure de Lyon and the University of Tennessee. However, we point out that in this first version of the report, experiments are limited to homogeneous platforms

    Temporal Locality in Today's Content Caching: Why it Matters and How to Model it

    Get PDF
    The dimensioning of caching systems represents a difficult task in the design of infrastructures for content distribution in the current Internet. This paper addresses the problem of defining a realistic arrival process for the content requests generated by users, due its critical importance for both analytical and simulative evaluations of the performance of caching systems. First, with the aid of YouTube traces collected inside operational residential networks, we identify the characteristics of real traffic that need to be considered or can be safely neglected in order to accurately predict the performance of a cache. Second, we propose a new parsimonious traffic model, named the Shot Noise Model (SNM), that enables users to natively capture the dynamics of content popularity, whilst still being sufficiently simple to be employed effectively for both analytical and scalable simulative studies of caching systems. Finally, our results show that the SNM presents a much better solution to account for the temporal locality observed in real traffic compared to existing approaches.Comment: 7 pages, 7 figures, Accepted for publication in ACM Computer Communication Revie

    Revisiting the Rice Theorem of Cellular Automata

    Full text link
    A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e. the infinite sequences of cell states. The limit set of the cellular automaton is the set of configurations which can be reached arbitrarily late in the evolution. In this paper, we prove that all properties of limit sets of cellular automata with binary-state cells are undecidable, except surjectivity. This is a refinement of the classical "Rice Theorem" that Kari proved on cellular automata with arbitrary state sets.Comment: 12 pages conference STACS'1

    Which game narratives do adolescents of different gameplay and sociodemographic backgrounds prefer? a mixed-methods analysis

    Get PDF
    OBJECTIVE: The aim of this study was to investigate which narrative elements of digital game narratives are preferred by the general adolescent population, and to examine associations with gender, socioeconomic status (SES), and gameplay frequency. Further, the study aims to discuss how results can be translated to serious digital games. MATERIALS AND METHODS: Adolescents were recruited through school to complete a survey on narrative preferences in digital games. The survey included questions on sociodemographic information, frequency of gameplay, and an open-ended question on what could be an appealing narrative for them. Data were analyzed in a mixed-methods approach, using thematic analysis and chi-square analyses to determine narrative preferences and the associations between game narrative elements and player characteristics (gender, SES, and frequency of gameplay). RESULTS: The sample consisted of 446 adolescents (12-15 years old) who described 30 narrative subthemes. Preferences included human characters as protagonists; nonhuman characters only as antagonists; realistic settings, such as public places or cities; and a strong conflict surrounding crime, catastrophe, or war. Girls more often than boys defined characters by their age, included avatars, located the narrative in private places, developed profession-related skills, and included a positive atmosphere. Adolescents of nonacademic education more often than adolescents of academic education defined characters by criminal actions. Infrequent players more often included human characters defined by their age than frequent players. After performing a Bonferroni correction, narrative preferences for several gender differences remained. CONCLUSION: Different narrative elements related to subgroups of adolescents by gender, SES, and frequency of gameplay. Customization of narratives in serious digital health games should be warranted for boys and girls; yet, further research is needed to specify how to address girls in particular
    • 

    corecore