Geneva G. Belford

Learn More
Review assignment is a common task that many people such as conference organizers, journal editors, and grant administrators would have to do routinely. As a computational problem, it involves matching a set of candidate reviewers with a paper or proposal to be reviewed. A common deficiency of all existing work on solving this problem is that they do not(More)
Reexamination of the theory of fluorescence time dependence owing to rotational diffusion of rigid macromolecules reveals deficiencies or hidden restrictions in each of the previous treatments. The correct master equation has five exponential decay terms, with preexponential factors that depend upon the diffusion constants and, in a completely symmetrical(More)
The file allocation problem — i.e. the problem of finding the optimal set of network sites at which to locate copies of a file — is known to be, in general, polynomial complete. Heuristics and other aids to finding optimal, or near-optimal, solutions are therefore much needed. In this paper we present three theorems which can be applied a priori(More)
The optimal choices of granularity (size of a physical lock) and the degree of multiprogramming (maximum number of transactions allowed to run concurrently) for a single-site database system (SDBS) using a locking mechanism for concurrency control have been investigated by many researchers, but the case for a distributed database system (DDBS) has not been(More)
Each transaction in a real-time database system is associated with a timing constraint in the form of a deadline. Eficient transaction scheduling algorithms are required to minimize the number of missed transaction deadlines. In this paper, a performance evaluation model is provided to enable distributed realtime database system designers to analyte(More)