A basis function approach to programming concurrent voting systems to perform selection tasks

  • Authors:
  • P. G. Raeth;S. C. Gustafson;G. R. Little

  • Affiliations:
  • Wright Laboratory, WL/FIPA 2210 8th Street, Bldg. 146, Suite 1 Wright-Patterson AFB, OH 45433-7511, U.S.A.;University of Dayton Research Institute Kettering Laboratory/ KL-463 Dayton, OH 45469-0140, U.S.A.;University of Dayton Research Institute Kettering Laboratory/ KL-463 Dayton, OH 45469-0140, U.S.A.

  • Venue:
  • Mathematical and Computer Modelling: An International Journal
  • Year:
  • 1994

Quantified Score

Hi-index 0.98

Visualization

Abstract

Voting is one method available to knowledge-based systems for dealing with selection uncertainty. Evidence on the validity of one or more selections is collected. Each piece of evidence then casts a ''vote'' for the defended selection. In this way, evidence in favor of various alternatives is accumulated. The numeric value of each vote depends on the applicability of the associated evidence. Thus, applicability controls the contribution each piece of evidence makes toward any specific selection. One difficult problem in any voting mechanism is finding a way to specify the numeric value of each vote in a given circumstance. One method of developing this situationally-dependent specification is the use of Gaussian radial basis functions by a network of processors operating concurrently. The technique discussed in this paper takes neural network technology as an inspiration for the implementation of such an information processing scheme. It provides a numerical method for solving a problem faced by symbolic knowledge-based systems, that of examining and deciding between alternatives using a large body of evidence. Due to the concurrent nature of the implementation, there is a great potential for real-time execution. The programs for the network of processors are developed in O(N) or O(N^2) time, depending on how the programs are developed. (N refers to the amount of evidence.) The network itself, once programmed, executes in O(1) time, if sufficient numbers of processors are employed. The number of processors modelled by a fully programmed network is O(N). This bound on execution and programming resources is predictable during problem specification. These advantages favor logistical supportability, a necessary system implementation requirement if advanced computing methods are to be incorporated into fielded equipment. This paper offers both theory and implementation. An illustrative example is given as well as references to related papers.