Downloaded from https://www.everyspec.com AACP 706-197 ) LIST OF ILLUSTRATIONS fA p etpoCase 9-9 Mis;.or,, Reliability for n Redundant Path, Cae 13, When R, (t) = 0.80 (r = 0.223) A./A = 0.001 ........... 9-13 9-10 s-Reliability Functions for Active-parallel Configurition, Case a 14, on Which Maintenance RItozred to Like-rm,w is Per- formed Every T Hours .................... .V1 5 9-11 Comparison of s-Reliability Functions for Three Maintenance Situatiom Cases 15, 16, and 17 .................... 9,16 10-1 Redundancy Tree Structure ..................... 1, 2 10-2 Relay Networks Illustrating Moore-Shannort Redundancy . . it3 10-3 s-Reliability Functions for Redundant Relay Networks ....
104 10-4 Single Mode Series-parallel Redundant Structures ........... 1 & 10-5 Reliability Block Diagram for a Single Mode Series-parallel Redundant Structure ......................... 10-5 10-6 Schematic Diagram of a Diode and Transistor Quad Bridge Network Illustrating Bimodal Series-parallel Redundancy . . 10-6 10-7 Reliability Block Diagram of a Diode and Transistor Quad Bridge Network ...... ........................ 10-6 10-8 Basic Majority Vote Redundant Circuit ................ 10-7 10-9 Majority Vote Redundant CircuitWith Multiple Majority Vote Taker ....... ............ .................
10-9 10-10 Reliability Block D~agram for CircuitWith Threefold Majority Logic ............................... 10-10 10-11 Order-three Multiple Line Redundant Network ........ .. 10-11 10-12 A Coherent System ............. ........ ..... .. 10-11 10-13 Circuit Illustrating Gate-connector Redundancy ......... 10-12 10-14Gate Unit ............ .................. .... 10-13 10-15 Two Models for a Noise AND Gate ................... 10-14 10-16 System Illustrating Standby Redundancy . .......... 10-16 10.17 System of m Redundant Chains Illustrating Operating Redundancy ..... ......................... .10-17 10-18 Failure Diagram of a Chain . . ............
10-18 10-19 Illustration of Duplex Redundancy . . ......... 10-20 11-1 Sample.CDF's for the E7,rmple (s-Normal Distribution Paper) 11-6 12.1 Finding the Minimum Using the Steepest Descent Method 12-5 12.2 Comparison of Fletcher-Powell and Optimum Gradient Tech- niques for Minimizing a Difficult Function . . . . . . . . . 12-7 12-3 Constraint Set ......... ............ . . 12-8 12-4 Nonlinear Programming Problem With Constrained Minimum 12-8 12-5 Nonlinear Programming Problem With Objective Function In- side the Constraint Set ....................... . . 12-8 & 12-6 Local Minimum ........................ 12-9 12-7 Local Minima Due to Curved Constraints ..............
12.9 12-8 Convex and Nonconvex Sets .... .................. 12-10 12-9 Concave and Convex Functions .................... 12-10 12-10 Convex Cone . . . ................ ................ .. 0-13 12-11 Nonlinear Program Illustrating the Use of a Cone ....... .. 12-. 4 12 12 Constrained Minimization With Usable, Feasible Directions ,, .2-19 12-13 An Inefficient Search Procedure .................... 12-17 vii