Keyword extraction attracts much attention for its significant role in various natural language processing tasks. While some existing methods for keyword extraction have considered using single type of semantic relatedness between words or inherent attributes of words, almost all of them ignore two important issues: 1) how to fuse multiple types of semantic relations between words into a unifor...

In recent years, many private corporations and government organizations have digitized corpuses of legacy paper documents. Often, these organizations hope to take advantage of digital representations to transform costly manual tasks associated with paper archives into less-costly computer-assisted tasks. The most common approach toward automated information extraction is through inverted indexi...

This paper examines the differences between author generated keywords and automatically generated keywords in one area of scientific and technical literature. Using inverse frequency, keywords produced using both methods are examined using a maximum likelihood algorithm. By reducing the scope and size of the corpus of literature examined, this study more closely emulates the information gatheri...

A test suite for a key interface within a dimensional measuring system (coordinate measuring machine or CMM) is presented. The test suite consists of test procedures, test definitions, and various testing utilities. A real-time, distributed test utilizing the test suite has been performed and is described. Keywords— conformance test, coordinate measuring machine, distributed testing, interface ...

We propose a fast silent self-stabilizing building a k-independent dominating set, named FID. The convergence of protocol FID, is established for any computation under the unfair distributed scheduler. FID reaches a terminal (also legitimate) configuration in at most 4n+k rounds, where n is the network size. FID requires (k + 1)log(n+ 1) bits per node. keywords distributed computing, fault tole...

Given a synchronous system, we study the question whether the behaviour of that system can be exhibited by a (non-trivially) distributed and hence asynchronous implementation. In this paper we show, by counterexample, that synchronous systems cannot in general be implemented in an asynchronous fashion without either introducing an infinite implementation or changing the causal structure of the ...