21336774
An Adapted Lesk Algorithm for Word Sense Disambiguation Using WordNet
This paper presents an adaptation of Lesk's dictionary-based word sense disambiguation algorithm. Rather than using a standard dictionary as the source of glosses for our approach, the lexical database WordNet is employed. This provides a rich hierarchy of semantic relations that our algorithm can exploit. This method is evaluated using the English lexical sample data from the SENSEVAL-2 word sense disambiguation exercise, and attains an overall accuracy of 32%. This represents a significant improvement over the 16% and 23% accuracy attained by variations of the Lesk algorithm used as benchmarks during the Senseval-2 comparative exercise among word sense disambiguation systems.
2969941
SmartNotes: Implicit Labeling of Meeting Data through User Note-Taking and Browsing
We have implemented SmartNotes, a system that automatically acquires labeled meeting data as users take notes during meetings and browse the notes afterwards. Such data can enable meeting understanding components such as topic and action item detectors to automatically improve their performance over a sequence of meetings. The SmartNotes system consists of a laptop based note taking application, and a web based note retrieval system. We shall demonstrate the functionalities of this system, and will also demonstrate the labeled data obtained during typical meetings and browsing sessions.
11158
SenseRelate: : TargetWord-A Generalized Framework for Word Sense Disambiguation
Many words in natural language have different meanings when used in different contexts. Sense Relate: Target Word is a Perl package that disambiguates a target word in context by finding the sense that is most related to its neighbors according to a WordNet: Similarity measure of relatedness.
40585807
Using Measures of Semantic Relatedness for Word Sense Disambiguation
This paper generalizes the Adapted Lesk Algorithm of Banerjee and Pedersen (2002) to a method of word sense disambiguation based on semantic relatedness. This is possible since Lesk's original algorithm (1986) is based on gloss overlaps which can be viewed as a measure of semantic relatedness. We evaluate a variety of measures of semantic relatedness when applied to word sense disambiguation by carrying out experiments using the English lexical sample data of SENSEVAL-2. We find that the gloss overlaps of Adapted Lesk and the semantic distance measure of Jiang and Conrath (1997) result in the highest accuracy.
6727358
Segmenting meetings into agenda items by extracting implicit supervision from human note-taking
Splitting a meeting into segments such that each segment contains discussions on exactly one agenda item is useful for tasks such as retrieval and summarization of agenda item discussions. However, accurate topic segmentation of meetings is a difficult task. In this paper, we investigate the idea of acquiring implicit supervision from human meeting participants to solve the segmentation problem. Specifically we have implemented and tested a note taking interface that gives value to users by helping them organize and retrieve their notes easily, but that also extracts a segmentation of the meeting based on note taking behavior. We show that the segmentation so obtained achieves a Pk value of 0.212 which improves upon an unsupervised baseline by 45% relative, and compares favorably with a current state-of-the-art algorithm. Most importantly, we achieve this performance without any features or algorithms in the classic sense.
206616812
The Design, Implementation, and Use of the Ngram Statistics Package
The Ngram Statistics Package (NSP) is a flexible and easy-to-use software tool that supports the identification and analysis of Ngrams, sequences of N tokens in online text. We have designed and implemented NSP to be easy to customize to particular problems and yet remain general enough to serve a broad range of needs. This paper provides an introduction to NSP while raising some general issues in Ngram analysis, and summarizes several applications where NSP has been successfully employed. NSP is written in Perl and is freely available under the GNU Public License.
16981937
Network traffic characterization of distributed database applications
The authors' efforts in characterizing the traffic of distributed database systems are described. This is an important class of applications considering that database or transaction processing systems form the core of several key commercial applications. Specific traffic source models for this application class have not been developed which is imperative for their successful deployment in emerging networks. The main contribution of the paper is to present the relationship between a distributed database application scenario and the corresponding network traffic characteristics, thus providing guidelines to these applications to compute their traffic descriptors accurately.
14976055
A new token passing distributed mutual exclusion algorithm
Eliminating interference between concurrently executing activities through mutual exclusion is one of the most fundamental problems in computer systems. The problem of mutual exclusion in a distributed system is especially interesting owing to the lack of global knowledge in the presence of variable communication delays. In this paper, a new token-based distributed mutual exclusion algorithm is proposed. The algorithm incurs approximately three messages at high loads, irrespective of the number of nodes N in the system. At low loads, it requires approximately N messages. The paper also addresses failure recovery issues, such as token loss.
40446138
A distributed hierarchical management framework for heterogeneous WANs
The scope of network management is expanding in multiple dimensions. Local area networks (LANs) have more nodes than ever before, enterprise networks span national boundaries, wide area networks (WANs) cover the globe, and administrators want to manage their LANs all the way down to a PC’s network interface and application software. In order to centrally manage these networks, the network manager faces the complexity of heterogeneous management tools and the difficulty of managing vast amount of data generated by network elements.
135907
Minimum energy reliable paths using unreliable wireless links
We address the problem of energy-efficient reliable wireless communication in the presence of unreliable or lossy wireless link layers in multi-hop wireless networks. Prior work [1] has provided an optimal energy efficient solution to this problem for the case where link layers implement perfect reliability. However, a more common scenario --- a link layer that is not perfectly reliable, was left as an open problem. In this paper we first present two centralized algorithms, BAMER and GAMER, that optimally solve the minimum energy reliable communication problem in presence of unreliable links. Subsequently we present a distributed algorithm, DAMER, that approximates the performance of the centralized algorithm and leads to significant performance improvement over existing single-path or multi-path based techniques.
30399081
Hypercube connected rings: a fault-tolerant and scalable architecture for virtual lightwave network topology
A new, fault-tolerant, scalable, and modular virtual topology for lightwave networks employing wavelength division multiplexing is proposed. The proposed architecture is based on a hypercube connected ring structure that enjoys the rich topological properties of a hypercube, but it also overcomes one of its drawbacks. In a hypercube, the nodal degree increases with the number of nodes. Hence, the per-node cost of the network increase as the network size grows. However, in a hypercube connected ring network (HCRNet) the nodal degree is small and it remains constant, independent of the network population. The HCRNet, like the hypercube, is perfectly symmetric in the sense that average internodal distance in an N-node HCRNet is the same from any source node. Its average internodal distance is in the order of logN and it is comparable to other regular structures such as Trous and ShuffleNet. The authors present the structural properties of the HCRNet and the network routing.<<ETX>>