Recent advancements in computer technology have increased the use of automated biometric-based identification and verification systems. These systems are designed to detect the identity of an individual when it is unknown or to verify the individual's identity when it is provided. These systems typically contain a series of complex technologies that work together to provide the desired results in turn, evaluating these systems is also a complex process. The authors provide a method that may be used to evaluate the performance of automated biometric-based systems. The method is derived from fundamental statistics and is applicable to a variety of systems. Examples are provided to demonstrate the practicality of the method.

A variant of the mapping problem, namely, systolic contractions of program graphs, is considered. The notion of time links is introduced to mechanize the contraction process; the timing of information flow between processors is modeled in terms of fundamental loop and path equations of delays and is optimized using linear programming. While the results apply primarily to systolic contractions, they can be extended to other types of graph contractions by relaxing the time constraints imposed by delay equations. Such contractions can, in principle, lead to faster execution of program graphics, since they may do away with the delays imposed on the links between the processors by systolic contractions. Clearly, storage is traded for time since extra storage may be necessary to hold some operands temporarily until a processor acquires all of its operands for a computation.>