43821577
When Can I Expect an Email Response? A Study of Rhythms in Email Usage
A study of email responsiveness was conducted to understand how the timing of email responses conveys important information. Interviews and observations explored users' perceptions of how they responded to email and formed expectations of others' responses to them. We identified ways in which users maintain and cultivate a responsiveness image for projecting expectations about their email response. We also discuss other contextual cues people use to discover email responsiveness, which include using other tools such as the calendar and phone, accounting for the amount of work time overlap available, and establishing a pacing between email correspondents. These cues help users develop a sense of when to expect a response and when breakdown has occurred, requiring further action.
8944311
Recent shortcuts: using recent interactions to support shared activities
We present an empirical study of teams that revealed the amount of extraneous individual work needed to enable collaboration: finding references to other people, finding files to attach to email, managing incoming email attachments, managing the variety of files used in shared activities, and tracking what work is owed to others. Much of this work involves finding recently accessed objects that are needed again in the user's current task focus. These observations led to the design of Recent Shortcuts, a tool to help support coordination by making recently used objects easily accessible. Recent Shortcuts enables quick access to people (including groups of people), received attachments, files, and file folders that the user interacted with recently for re-use in the user's current context. Recent Shortcuts makes it easy to use these objects across applications with no additional user input and minimal changes to the user's applications or work practice. Early user experiences with a working prototype led to an extension that integrates recently accessed objects across multiple devices.
10355154
Supporting distributed groups with a Montage of lightweight interactions
The Montage prototype provides lightweight audio-video glances among distributed collaborators and integrates other applications for coordinating future contact. We studied a distributed group across three conditions: before installing Montage, with Montage, and after removing Montage. We collected quantitative measures of usage as well as video-tape and user perception data. We found that the group used Montage glances for short, lightweight interactions that were like face-to-face conversations in many respects. Yet like the phone, Montage offered convenient access to other people without leaving the office. Most glances revealed that the person was not available, so it was important to integrate other tools for coordinating future interaction. Montage did not appear to displace the use of e-mail, voice-mail, or scheduled meetings.
6543572
Findings from Observational Studies of Collaborative Work
Abstract The work activity of small groups of three to four people was videotaped and analysed in order to understand collaborative work and to guide the development of tools to support it. The analysis focused on the group's shared drawing activity—their listing, drawing, gesturing and talking around a shared drawing surface. This analysis identified specific features of collaborative work activity that raise design implications for collaborative technology: (1) collaborators use hand gestures to uniquely communicate significant information; (2) the process of creating and using drawings conveys much information not contained in the resulting drawings; (3) the drawing space is an important resource for the group in mediating their collaboration; (4) there is a fluent mix of activity in the drawing space; and (5) the spatial orientation among the collaborators and the drawing space has a role in structuring their activity. These observations are illustrated with examples from the video data, and the design implications they raise are discussed.
1186186
Piazza: a desktop environment supporting impromptu and planned interactions
Much of the support for communication across distributed communities has focused on meetings and intentional contact. However, most interactions within co-located groups occur when people happen to run into each other. Such unintended interactions should also be supported among distributed communities. We conducted a study of the communication patterns of a large, distributed organization and found that people tend to disseminate information using formal techniques, even though people usually receive information informally. We then designed a system called Piazza that is intended to support the range of communication styles evident in large communities, paying particular attention to adchessing the problems revealed in our study. Piazza allows people to be aware of others who are doing similar tasks when they are using their computers, the~by enabling unintended interactions. It also supports intentiomd contacts and planned meetings. We discuss issues for analysis in an upcoming use study.
206793142
What video can and cannot do for collaboration: A case study
As multimedia become an integral part of collaborative systems, we must understand how to design such systems to support the user's rich set of existing interaction skills, rather than requiring people to adapt to arbitrary constraints of technology-driven designs. To understand how we can make effective use of video in remote collaboration, we compared a small team's interactions through a desktop video conferencing prototype with face-to-face interactions and phone conversations. We found that, compared with audio-only, the video channel of our desktop video conferencing prototype adds or improves the ability to show understanding, forecast responses, give nonverbal information, enhance verbal descriptions, manage pauses, and express attitudes. These findings suggest that video may be better than the phone for handling conflict and other interaction-intense activities. However, the advantages of video depend critically on the nearly-instantaneous transmission of audio, even if it means getting out of sync with the video image. Nonetheless, when compared with face-to-face interaction, it can be difficult in video interactions to notice peripheral cues, control the floor, have side conversations, point to things or manipulate real-world objects. To enable rich interactions fully, video should be integrated with other distributed tools that increase the extent and type of shared space in a way that enables natural collaborative behaviors within those environments.
1746627
Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data
Phylogeny reconstruction from gene-order data has attracted much attention over the last few years. The two software packages used for that purpose, BPAnalysis and GRAPPA, both use so-called breakpoint medians in their computations. Some of our past results indicate that using inversion scores rather than breakpoint scores in evaluating trees leads to the selection of better trees. On that basis, we conjectured that phylogeny reconstructions could be improved by using inversion medians, which minimize evolutionary distance under an inversions-only model of genome rearrangement. Recent algorithmic developments have made it possible to compute inversion medians for problems of realistic size.Our experimental studies unequivocally show that inversion medians are strongly preferable to breakpoint medians in the context of phylogenetic reconstruction from gene-order data. Improvements are most pronounced in the reconstruction of ancestral genomes, but are also evident in the topological accuracy of the reconstruction as well as, surprisingly, in the overall running time. Improvements are strongest for small average distances along tree edges and for evolutionary scenarios with a preponderance of inversion events, but occur in all cases, including evolutionary scenarios with high proportions of transpositions.All of our tests were run using our GRAPPA package, available (under GPL) at www.cs.unm.edu/~moret/GRAPPA; the next release will include the inversion median software we used in this study. The software used includes RevMed, developed by the authors and available at www.cs.unm.edu/~acs, and A. Caprara's inversion median code, generously made available for testing.
4263841
Tree-Structured Conditional Random Fields for Semantic Annotation
The large volume of web content needs to be annotated by ontologies (called Semantic Annotation), and our empirical study shows that strong dependencies exist across different types of information (it means that identification of one kind of information can be used for identifying the other kind of information). Conditional Random Fields (CRFs) are the state-of-the-art approaches for modeling the dependencies to do better annotation. However, as information on a Web page is not necessarily linearly laid-out, the previous linear-chain CRFs have their limitations in semantic annotation. This paper is concerned with semantic annotation on hierarchically dependent data (hierarch-ical semantic annotation). We propose a Tree-structured Conditional Random Field (TCRF) model to better incorporate dependencies across the hierarchic-ally laid-out information. Methods for performing the tasks of model-parameter estimation and annotation in TCRFs have been proposed. Experimental results indicate that the proposed TCRFs for hierarchical semantic annotation can significantly outperform the existing linear-chain CRF model.
5173411
Email data cleaning
Addressed in this paper is the issue of 'email data cleaning' for text mining. Many text mining applications need take emails as input. Email data is usually noisy and thus it is necessary to clean it before mining. Several products offer email cleaning features, however, the types of noises that can be eliminated are restricted. Despite the importance of the problem, email cleaning has received little attention in the research community. A thorough and systematic investigation on the issue is thus needed. In this paper, email cleaning is formalized as a problem of non-text filtering and text normalization. In this way, email cleaning becomes independent from any specific text mining processing. A cascaded approach is proposed, which cleans up an email in four passes including non-text filtering, paragraph normalization, sentence normalization, and word normalization. As far as we know, non-text filtering and paragraph normalization have not been investigated previously. Methods for performing the tasks on the basis of Support Vector Machines (SVM) have also been proposed in this paper. Features in the models have been defined. Experimental results indicate that the proposed SVM based methods can significantly outperform the baseline methods for email cleaning. The proposed method has been applied to term extraction, a typical text mining processing. Experimental results show that the accuracy of term extraction can be significantly improved by using the data cleaning method.
27349578
On multilevel voting
SummaryIn a distributed system mutual exclusion is often used to maintain consistency when restricted operations are performed. Mechanisms guaranteeing mutual exclusions should be both resilient and efficient. Resiliency implies high resource availability in the face of failures, while efficiency implies low overhead incurred by performing restricted operations. In this paper, we propose and study a general paradigm, called multilevel voting, which provides a general framework to assist in the design of resilient and efficient mutual exclusion mechanisms. The proposed method uses multiple level quorum consensus. Unlike another method based on the use of multiple quorum consensus, the proposed model only contains one type of integrity constraints. This has the benefit of being conceptually simple and easy to reason about. The strong resemblance with the traditional quorum consensus makes it easy for the proposed paradigm to embed any technique based on traditional quorum schemes. We show that the proposed model represents the exact class of coteries. This means that not only does it have all the power of coteries, but also all schemes under the model are correct. Thus, should the need arise, we can interchange two schemes freely without using any extra mechanisms to ensure correctness. We study a number of issues that have impact on performance such as the degree of a multilevel scheme and the order of a coterie. We explain how the model can be extended also to model the schemes for the synchronization of read and write of replicated data. We provide algorithms for the design of multilevel schemes in the context of mutual exclusion and that of read and write of replicated data.
207188648
Reliable Ad Hoc Routing Based on Mobility Prediction
Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, because some of the wireless links along a shortest path may be broken shortly after the path is established due to mobility of mobile nodes. Rediscovering routes may result in substantial data loss and message exchange overhead. In this paper, we study reliable ad hoc routing in the urban environment. Specifically, we formulate and study two optimization problems. In the minimum Cost Duration-bounded Path (CDP) routing problem, we seek a minimum cost source to destination path with duration no less than a given threshold. In the maximum Duration Cost-bounded Path (DCP) routing problem, we seek a maximum duration source to destination path with cost no greater than a given threshold. We use a waypoint graph to model the working area of a MANET and present an offline algorithm to compute a duration prediction table for the given waypoint graph. An entry in the duration prediction table contains the guaranteed worst-case duration of the corresponding wireless link. We then present an efficient algorithm which computes a minimum cost duration-bounded path, using the information provided in the duration prediction table. We also present a heuristic algorithm for the DCP routing problem. In addition, we show that the proposed prediction and routing schemes can be easily applied for designing reliable ad hoc routing protocols. Simulation results show that our mobility prediction based routing algorithms lead to higher network throughput and longer average path duration, compared with the shortest path routing.