41663728
The JAVELIN Question-Answering System at TREC 2002
This Conference Proceeding is brought to you for free and open access by the School of Computer Science at Research Showcase. It has been acceptedfor inclusion in Computer Science Department by an authorized administrator of Research Showcase. For more information, please contactkbehrman@andrew.cmu.edu.
6591350
Inferring Ongoing Activities of Workstation Users by Clustering Email
We are interested in automatically discovering the key ongoing activities of a workstation user, such as committees to which she belongs, writing projects in which she is involved, etc., based on the contents of her workstation. The thesis underlying our research is that this collection of user activities can be automatically inferred from the variety of data available on most users’ workstations, including their emails, files, online calendar, and history of web page accesses. Knowledge about the user's activities could be used in a variety of ways, such as cross-indexing email, calendar events, files, and web accesses according to activity, or automatically producing a 'briefing folder' for each meeting on the user's calendar. We describe here our initial research on inferring such activities by examining only the user's email. In particular, we describe a variety of unsupervised clustering methods designed for clustering emails by user activity, and the use of information extractors and pretrained classifiers to infer additional information about each discovered cluster. Experimental results are presented for emails from three users.
3154384
Text clustering with extended user feedback
Text clustering is most commonly treated as a fully automated task without user feedback. However, a variety of researchers have explored mixed-initiative clustering methods which allow a user to interact with and advise the clustering algorithm. This mixed-initiative approach is especially attractive for text clustering tasks where the user is trying to organize a corpus of documents into clusters for some particular purpose (e.g., clustering their email into folders that reflect various activities in which they are involved). This paper introduces a new approach to mixed-initiative clustering that handles several natural types of user feedback. We first introduce a new probabilistic generative model for text clustering (the SpeClustering model) and show that it outperforms the commonly used mixture of multinomials clustering model, even when used in fully autonomous mode with no user input. We then describe how to incorporate four distinct types of user feedback into the clustering algorithm, and provide experimental evidence showing substantial improvements in text clustering when this user feedback is incorporated.
29686713
A note on Ramsey numbers with two parameters
The Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertices either G contains G1 or G- contains G2, where G- denotes the complement of G. In this paper, some new bounds with two parameters for the Ramsey number R(G1, G2), under some assumptions, are obtained. Especially, we prove that R(K6 - e, K6) ≤ 116 and R(K6 - e, K7) ≤ 202, these improve the two upper bounds for the classical Ramsey number in [S.P. Radziszowski, Small Ramsey number, Electron. J. Combin. DSI (2002) 1-36].
14183146
Replicated condition monitoring
A condition monitoring system tracks real-world variables and alerts users when a predefined condition becomes true, e.g., when stock price drops, or when a nuclear reactor over-heats. Replication of monitoring servers can reduce the probability that an important alert is missed. However, replicated independent servers can sometimes report “conflicting” alerts to the user, causing confusion. In this paper, we study the problem of replicated condition monitoring. We identify and formally define three desirable properties of a replicated system, namely, orderedness, consistency, and completeness. We propose new monitoring algorithms that enforce some or all of the desired properties in different scenarios.
2495453
A dual index model for contextual information retrieval
In this paper, we propose a dual index model for contextual IR. For each query, we search against both document level and passage level indexes, and use the corresponding merge function to update the weights for both documents and paragraphs by combining the results from both indexes according to the granularity information in metadata. Experiments on 2004 TREC data show that a significant improvement can be made by using the dual index model.
21281863
Practical key distribution schemes for channel protection
The paper presents three key distribution schemes for channel protection. With the proposed schemes, encryption keys of the ordered programs can be distributed to the authorized subscribers efficiently and securely. In these schemes, for key updates, at most two messages are transmitted and simpler computation functions, including one-way hash function and XOR operation, are used to reduce the computation cost compared to existing solutions. With our key distribution schemes, only the authorized subscribers can decrypt the ordered programs. Thus, the service provider in a Pay-TV system can charge his subscribers according to their subscriptions and the intelligent property rights of TV programs can be protected by the proposed schemes.
16825524
Resilient State Management in Large Scale Networks
This paper describes, briefly, ongoing research on resource reservation state management, including research motivations and initial design.