| Abstraction, Inspection and Debugging in Programming |
JUN 1981 |
|
| Authors:
Charles Rich; Richard C. Waters; MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB
|
 | We believe that software engineering has much to learn from other mature engineering disciplines, such as electrical engineering, and that the problem solving behaviors of engineers in different disciplines have many similarities. Three key ideas in current artificial intelligence theories of engineering problem solving are: Abstraction -- using a simplified view of the problem to guide the problem solving process. Inspection -- problem solving by recognizing the form ('plan') of ... |
|
| Preliminary Analysis of a Breadth-First Parsing Algorithm: Theoretical and Experimental Results |
JUN 1981 |
|
| Authors:
William A. Martin; Kenneth W. Church; Ramesh S. Patil; MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE
|
| We will trace a brief history of context-free parsing algorithms and then describe some representation issues. The purpose of this paper is to share our philosophy and experience in adapting a well-known context free parsing algorithm (Earley's algorithm and variations thereof) to the parsing of a difficult and wide ranging corpus of sentences. The sentences were gathered by Malhotra in an experiment which fooled businessmen users into thinking they were ... |
|
| A Distributed Shortest Path Protocol |
JUN 1981 |
|
| Authors:
Francine B. M. Zerbib; Adrian Segall; MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND DECISION SYSTEMS
|
| We present a distributed protocol for obtaining the shortest paths between all pairs of nodes in a network with weighted links. The protocol is based on an extension of the Dijkstra (centralized) shortest path algorithm and uses collaboration between neighboring nodes to transfer the information needed at the nodes for the successive construction of the shortest paths. A formal description of the protocol is given by indicating the exact algorithm ... |
|
| Procedural Handbook for Escape System/Accident Investigation Helmet Usage Aspects, Including Failure Analysis |
20 MAY 1981 |
|
| Authors:
Robert Snyder; NAVAL AIR DEVELOPMENT CENTER WARMINSTER PA AIRCRAFT AND CREW SYSTEMS TECHNOLOGY DIRECTORATE
|
| Aircrew protective helmets are currently developed to reduce the severity of head impact injuries. Many helmets involved in ejections and land and water crashes may provide clues concerning the sequence of events immediately prior to and/or during the accident. Helmet design may have been a factor in the serious and sometimes fatal injuries sustained during these accidents. This handbook will describe a systematic analysis of aircrewman's helmets involved in accidents ... |
|
| Solving Multiactivity Multifacility Capacity-Constrained 0-1 Assignment Problems |
12 MAY 1981 |
|
| Authors:
Krishan Lal Chhabra; GEORGE WASHINGTON UNIV WASHINGTON DC PROGRAM IN LOGISTICS
|
| A branch-and-bound solution algorithm and a computer program implementing this algorithm are developed to solve multiactivity multifacility capacity-constrained 0-1 assignment problems. Such 0-1 integer programming problems have the objective of minimizing the sum of variable costs due to the assignment of the activities to designs and fixed costs due to the inclusion of the facilities chosen. The constraints ensure that each activity is assigned to a single design and that ... |
|
| A Syntactic Method for Time-Varying Pattern Analysis |
MAY 1981 |
|
| Authors:
Tzu-I J. Fan; K. S. Fu; PURDUE UNIV LAFAYETTE IN SCHOOL OF ELECTRICAL ENGINEERING
|
| A syntactic method for the analysis of time-varying image patterns is proposed and studied. This method utilizes translation schema to model the time- varying properties of image patterns. A syntactic deformation model is first applied to transform the i-th image into the (i+1)-th image of an image sequence. Then the concept of translation in formal Language theory is used as a mechanism to characterize the dynamic process of the image ... |
|
| An Algorithm to Select the Best Subset for a Least Absolute Value Regression Problem |
MAY 1981 |
|
| Authors:
R. D. Armstrong; M. T. Kung; TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES
|
| This paper considers the problem of obtaining the best subset of regressors under a least absolute value criterion. The model is the classic linear regression model with m explanatory variables and a dependent variable. The importance of the explanatory variables is measured by obtaining the minimum sum of absolute deviations when only k of the m explanatory variables are included in the model. An algorithm is presented to obtain the ... |
|
| Format Options and Procurement of Technical Orders. |
MAY 1981 |
|
| Authors:
G. Richard Hatterick; Harold E. Price; BIOTECHNOLOGY INC FALLS CHURCH VA
|
| Previous research by Air Force and other DOD agencies has resulted in the development of several improved techniques for creating, and formats for presenting, technical data for maintenance. Application of these techniques and formats for presenting, technical data for maintenance. Application of these techniques and formats for operational use has been hindered by the fact that technical data managers frequently do not have sufficient information on the improved techniques and ... |
|
| Applicability of SREM to the Verification of Management Information System Software Requirements. Volume II |
30 APR 1981 |
|
| Authors:
R. P. Loshbough; M. W. Alford; J. T. Lawson; D. M. Sims; T. R. Johnson; TRW DEFENSE AND SPACE SYSTEMS GROUP HUNTSVILLE ALA
|
| This volume provides the appendices that accompany Volume I. Applicability of SREM to the Verification of Management Information System Software Requirements. It contains the following four Appendices: (1) Operation of REVS on the VAX System, (2) Regeneration of Requirements, (3) Application of RADX, and (4) Trouble Reports. |
|
| Applicability of SREM to the Verification of Management Information System Software Requirements. Volume I |
30 APR 1981 |
|
| Authors:
R. P. Loshbough; M. W. Alford; J. T. Lawson; D. M. Sims; T. R. Johnson; TRW DEFENSE AND SPACE SYSTEMS GROUP HUNTSVILLE ALA
|
| This document concerns TRW's demonstration of the application of the Software Requirements Engineering Methodology (SREM) to an existing Government Detailed Functional System Requirements (DFSR). The objective of this effort was to demonstrate the power of SREM as a tool to verify a software requirement, with the goal of determining the extent to which it was a complete, consistent, and unambiguous document. Specifically, the intent was to attain an understanding of ... |
|
| Compilation of Nonprocedural Specifications into Computer Programs |
01 APR 1981 |
|
| Authors:
N. S. Prywes; A. Pnueli; MOORE SCHOOL OF ELECTRICAL ENGINEERING PHILADELPHIA PA
|
| The article describes the compilation of a program specification written in the Very high Level nonprocedural MODEL language into an object (PL/I or Cobol) procedural language program. Nonprocedural programming languages are descriptive and devoid of procedural controls. They are therefore easier to use and require less programming skills than procedural languages. First, the MODEL language is briefly presented and illustrated. An important phase in the compilation process is the representation ... |
|
| Decision Support with Partially Identified Parameters. |
15 MAR 1981 |
|
| Authors:
Chelsea C. White III; Andrew P. Sage; William T. Scherer; VIRGINIA UNIV CHARLOTTESVILLE DEPT OF ENGINEERING SCIENCE AND SYSTEMS
|
| In this paper, we investigate problem of determining a perference structure on the set of alternatives for a general class of single-stage, choice making models with imprecisely known parameters. A variety of decision making problems under certainty and under uncertaintly are modeled by the general problem formulation. The imprecisely known parameters can be, for example, attribute trade-off weights, value scores, value scores, probabilities, and utility values. Parameter imprecision is described ... |
|
| A Proposed Flight Safety Program for the Korean Air Force |
MAR 1981 |
|
| Authors:
Chong Kwan Lee; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| Several methodologies relevant to the development of a safety program for the Korean Air Force were reviewed. Methodologies considered included: Control charts; System safety analysis; and Critical incident technique. Data collection methods applicable to accident analysis were proposed. Recommendations for the incorporation of these methods into a safety program for the K.A.F. were developed. The safety program described in this thesis possesses the potential for reducing overall operational costs and ... |
|
| Vehicle Routing Algorithms for Local Delivery at Naval Supply Centers |
MAR 1981 |
|
| Authors:
Clifford O. Clausen; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| This thesis examines the local delivery operations at the Naval Supply Centers in Oakland and San Diego. The local delivery problem is formulated as a model applicable to these supply centers. Specifically, the model involves routing a fleet of vehicles from a central depot to each of a set of customers so as to satisfy their demands. Twelve heuristic solution methods applicable to this model are reviewed and illustrated with ... |
|
| Enhanced Decision Analysis Support System |
MAR 1981 |
|
| Authors:
David B. Lee; AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING
|
| The enhanced version of the Decision Analysis Support System (DASS) is a highly interactive computer-aided decision analysis tool. It automates the method for determining preferences when multiple and competing attributes are involved. Worth assessment is used as the model which evaluates a deterministic hierarchical tree structure, although risk can be evaluated by incorporating risk into the tree or by conducting sensitivity analyses. The objective of this work was to incorporate ... |
|
| ASGOL-An ALGOL-Structured Graphics Oriented Language |
MAR 1981 |
|
| Authors:
James David Hart; AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING
|
| An ALGOL-like graphics oriented language and system was designed to provide a block-structured format to graphics programs. The system was developed with an LR(1) parsing procedure technique, and graphs are constructed using the DISSPLA software package as the 'host' to generate device-independent plot files. The language produces linear, bar and pie graphs, as well as having a text processor to draw a variety of character styles and fonts for documentation. ... |
|
| A Note on Specialized Versus Unspecialized Methods for Maximum Flow Problems |
MAR 1981 |
|
| Authors:
Fred Glover; Darwin Klingman; Melissa Mead; TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES
|
| A study developing highly efficient versions of both primal simplex and labeling methods for maximum flow problems has disclosed the surprising superiority of specialized primal methods. These provocative findings not only overturn standard expectation about the relative performance of simplex versus labeling approaches, but also raise the intriguing question of whether--or to what extent--it is useful to develop specialized methods for maximum flow problems. This issue was investigated by testing ... |
|
| Parallel Scheduling Algorithms |
MAR 1981 |
|
| Authors:
Eliezer Dekel; Sartaj Sahni; MINNESOTA UNIV MINNEAPOLIS DEPT OF COMPUTER SCIENCE
|
| We obtain fast parallel algorithms for several scheduling problems. Some of the problems considered are: scheduling to minimize the number of tardy jobs; job sequencing with deadlines; scheduling to minimize earliness and tardiness penalties; channel assignment; and minimizing the mean finish time. The shared memory model of parallel computers is used. (Author) |
|
| Image Segmentation by Texture Using Pyramid Node Linking. |
FEB 1981 |
|
| Authors:
Matti Pietikainen; Azriel Rosenfeld; MARYLAND UNIV COLLEGE PARK COMPUTER VISION LAB
|
| In a 'pyramid' of successively reduced-resolution versions of an image, by linking nodes representing image blocks to nodes representing nearby larger blocks that most closely resemble them, we can construct trees (defined by the links) representing homogeneous parts of the input image. In this paper, we apply this approach to segmenting an image on the basis of texture. We start from an initial decomposition of the image into small blocks ... |
|
| Failure Analysis Seminar: Techniques and Teams. Seminar Notes. Volume I |
JAN 1981 |
|
| Authors:
ARMY ARMAMENT RESEARCH AND DEVELOPMENT COMMAND DOVER NJ SYSTEMS EVALUATION OFFICE
|
| The FAILURE ANALYSIS SEMINAR: TECHNIQUES AND TEAMS (FASTT) is a concentrated, high-intensity, three-day (24 hours) workshop/seminar designed for functional engineers and mid-level engineering management personnel. The sessions concentrate on identifying problem areas using an indepth, structured analysis of technical and operational problems. In a broader sense, FASTT is a diagnostic process and a way of thinking for engineering or technical personnel involved in the design and/or operation of complex systems. ... |
|
| NETGEN-II: A System for Generating Structured Network-Based Mathematical Programming Test Problems |
JAN 1981 |
|
| Authors:
Joyce Elam; Darwin Klingman; TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES
|
| The increased importance of designing and implementing algorithms to solve particular management problems has created the need for more robust test problem generators that can match the overall structure and parameter values of these problems. Of particular interest are management problems that can be modeled using a network structure. This paper discussed the design of a system for generating network-based mathematical programming test problems that conform to user-supplied structural & ... |
|
| Performance Models of Distributed Database Systems. |
JAN 1981 |
|
| Authors:
Victor On-Kwok Li; MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND DECISION SYSTEMS
|
| A distributed database (DDB) consists of redundant copies of data files geographically distributed on a computer network. This thesis develops a performance model of a DDB. This model can be used to compare the performance (i.e. response time, utilization, etc.) of different concurrency control algorithms. We started by developing a network of queues model of a communication subnetwork. We have originally attempted to employ Jackson's Model but have concluded that ... |
|
| A Conceptual Framework for Grammar-Driven Synthesis |
DEC 1980 |
|
| Authors:
William R. Shockley; Daniel P. Haddow; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| Conventional parsing techniques use grammars as embedded procedural knowledge bases in mechanisms which are capable of translating words in the language defined into equivalent parse trees. The approach described in this paper uses context-free grammars as data allowing access to synthesis templates which enable the user to create and interact with parse trees directly. The advantages of this approach are the utility of human-oriented grammars, the dynamic interchangeability of language ... |
|
| An Investigation of Several Branching Functions in a Branch and Bound Algorithm for the Chromatic Number Problem. |
DEC 1980 |
|
| Authors:
Ronald Ernest Rautenberg; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| The chromatic number problem is to determine the minimum number of colors to assign to the vertices of a graph such that no connected vertices are assigned the same color. This paper presents a branch and bound solution to the chromatic number problem and investigates five different branching functions. Additionally, a method of coloring very sparse graphs is presented which divides a graph into biconnected components and reduces the time ... |
|
| Reconfigurable Cellular Computers |
OCT 1980 |
38 pages |
| Authors:
Azriel Rosenfeld; Angela Y. Wu; MARYLAND UNIV COLLEGE PARK COMPUTER SCIENCE CENTER
|
 | When a collection of processors C= (P sub i,..., P sub n) operates in parallel, it is desirable that at any given stage of the computation, each P sub i should have a task of about the same size to perform, and each P sub i should require about the same amount of information from the other P's in order to perform its task. To the extent that these conditions ... |
|
| Software System Safety. |
OCT 1980 |
|
| Authors:
Donald M. Layton; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| An examination of software system safety analysis has been made and generalized techniques examined. These techniques parallel the techniques used for hardware analysis and are, in fact, predicted on the fact that the only safety perturbation in software is one that directs or misdirects a hardware component. Discussion is presented for a top to bottom and a bottom up hierarchial analysis, as well as an integrated technique. (Author) |
|
| Fundamental Scheme for Train Scheduling (Application of Range-Constriction Search). |
SEP 1980 |
|
| Authors:
Koji Fukumori; MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB
|
| Traditionally, the compilation of long-term timetables for high density rail service with multiple classes of trains of the same track is a job for expert people, not computers. We propose an algorithm that uses the range-constriction search technique to schedule the timing and pass-through relations of trains smoothly and efficiently. The program determines how the timing of certain trains constrains and timing of others, finds possible time regions and pass-through ... |
|
| Efficient Accessing of a Multiaccess Channel. |
SEP 1980 |
|
| Authors:
Pierre A. Humblet; Jeannine Mosely; MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND DECISION SYSTEMS
|
| A discrete time multiaccess channel is considered where the outcome of a transmission is either idle, success, or collision, depending on the number of uses transmitting simultaneously. Messages involved in a collision must be retransmitted. An efficient access allocation policy is developed for the case where infinitely many sources generate traffic in a Poisson manner and can all observe the outcomes of the previous transmissions. Its rate of success is ... |
|
| Problematic Features of Programming Languages: A Situational-Calculus Approach. Part I. Assignment Statements. |
SEP 1980 |
|
| Authors:
Zohar Manna; Richard Waldinger; STANFORD UNIV CA DEPT OF COMPUTER SCIENCE
|
| Certain features of programming languages, such as data structure operations and procedure call mechanisms, have been found to resist formalization by classical techniques. An alternate approach is presented, based on a 'situational calculus,' which makes explicit reference to the states of a computation. For each state, a distinction is drawn between an expression, its value, and the location of the value. Within this conceptual framework, the features of a programming ... |
|
| An Outlook on Truth Maintenance. |
AUG 1980 |
|
| Authors:
David A. McAllester; MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB
|
| Truth maintenance systems (TMS) have been used in several recent problem-solving systems to record justifications for deduced assertions, to track down the assumptions which underlie contradictions when they arise, and to incrementally modify assertional data structures when assumptions are retracted. This report describes a TMS algorithm that is substantially different from previous systems. This algorithm performs deduction in traditional propositional logic in such a way that the premise set from ... |
|
| Recovery from Node Failure in a Contract NET, |
AUG 1980 |
|
| Authors:
Philip Steven Prince Jr; AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH
|
| The problem of a catastrophic node failure in a contract net is addressed. The Stanford Research Institute Problem Solver (STRIPS) will be distributed by means of the contract net protocol, and used as a medium for studying the methods that might be used to recover from the node failure. Four methods will be described and compared, with respect to normal and recovery operational costs. |
|
| APU Man-Computer Studies Group Seminar Proceedings I February 1980 - April 1980. |
JUN 1980 |
|
| Authors:
R. Gregory; ADMIRALTY MARINE TECHNOLOGY ESTABLISHMENT TEDDINGTON (ENGLAND)
|
| Contents: Three Computer Roles in a Cybernetic Learning System; The Representation of Knowledge: Goldstein's Genetic Graph; The Representation of Knowledge: Pask's L sub p. |
|
| A Precise and Efficient Algorithm for Determining Existential Summary Data Flow Information, |
MAR 1980 |
|
| Authors:
Eugene W. Myers; COLORADO UNIV AT BOULDER DEPT OF COMPUTER SCIENCE
|
| Data flow analysis is well understood at the intra-procedural level and efficient algorithms are available. When inter-procedural mechanisms such as recursion, procedure nesting, and pass-by-reference parameters are introduced, the data flow problems become more difficult. Let ISIZE be the size of the problem and OSIZE be the size of the resulting data flow relation. A O(ISIZE+OSIZE) algorithm is demonstrated for the existential summary data flow problem. (Author) |
|
| Research in Complexity Theory and Combinatorial Algorithms |
1980 |
|
| Authors:
C. L. Liu; Jane W. S. Liu; J. R. Egan; M. Ghiassi; J. L. Lewandowski; ILLINOIS UNIV AT URBANA DEPT OF COMPUTER SCIENCE
|
| Since October 1, 1979, research in Complexity Theory and Combinatorial Algorithms at the Department of Computer Science at the University of Illinois was supported by the Office of Naval Research. During this period of time, research work was carried out in the areas of Computational Complexity Theory, Scheduling Algorithms, Graph Algorithms, Dynamic Programming, and Fault- Tolerance Computing. We summarize here our accomplishments and our future plans, and we wish to ... |
|
| Multiple Limit Point Bifurcation, |
1980 |
|
| Authors:
Dwight W. Decker; Herbert B. Keller; CALIFORNIA INST OF TECH PASADENA DEPT OF APPLIED MATHEMATICS
|
|
| BIT/External Test Figures of Merit and Demonstration Techniques |
DEC 1979 |
185 pages |
| Authors:
T. F. Pliska; F. L. Jew; J. E. Angus; ROME AIR DEVELOPMENT CENTER GRIFFISS AFB NY
|
| Current maintainability parameters and corresponding analysis/ demonstration techniques lack the capability of expressing the adequacy of Built-in-Test and/or External Test Equipment (BIT/ETE). Figures of Merit (FOMs) have been identified and defined that can be used to express the adequacy of BIT/ETE. Methodologies have been developed to analyze and demonstrate the defined BIT/ETE FOMs. A methodology has been developed to methodically select the BIT/ETE FOMs required in system/equipment specifications based on ... |
|
| Missile Acquisition Study. |
AUG 1979 |
|
| Authors:
Robert S. Young; Thomas M. O'Hern Jr; LOGISTICS MANAGEMENT INST WASHINGTON DC
|
| This study was commissioned by the Naval Air Systems Command (NAVAIR) to: (1) assess the feasibility and desirability of acquiring air-launched missiles from contractors in a ready-for-use configurations (known as the All-Up-Round (AUR) configuration), and (2) construct a Government-furnished equipment versus Contractor-furnished equipment (GFE/CFE) decision tree to assist acquisition personnel in making sound business judgments regarding the use of GFE and CFE in individual missile acquisition programs. Regardless of the ... |
|
| Generic Data Transaction System. Version 2. System Design. |
MAR 1979 |
|
| Authors:
John E. Evans III; L. Hardy Mason; Robert C. Williges; VIRGINIA POLYTECHNIC INST AND STATE UNIV BLACKSBURG HUMAN FACTORS LAB
|
| This report and its companion (HFL-79-3/NPRDC-79-2) supercede HFL-78-2/NPRDC-78-2, documenting an enhanced version of the same system. The program described is a machine dependent, table driven, general software system written for the advanced programmer to communicate the internal operations of the software. Included are a description of data structures, program logic, and user interfaces. The Fortran IV software processes randomly accessed data which are tree structured by file, record, page, and ... |
|
| A Note on an NP-Complete Problem |
1979 |
|
| Authors:
J. L. Lewandowski; ILLINOIS UNIV AT URBANA DEPT OF COMPUTER SCIENCE
|
| We show in this note that the problem of two-coloring a graph G = (V, E) with a distinguished vertex p and two distinguished subset A (p) and B (p) of V, such that there is a red connected subgraph containing A + p, and a blue connected subgraph containing B + p, is NP-Complete. We prove this by reduction of 3-satisfiability by constructing, for a given boolean expression in ... |
|
| Automated Test Design. |
JUN 1978 |
|
| Authors:
Cihan Tinaztepe; MOORE SCHOOL OF ELECTRICAL ENGINEERING PHILADELPHIA PA DEPT OF COMPUTER AND INFORMATION SCIENCES
|
| A methodology for designing tests to diagnose and isolate failures in analog circuits has been developed and implemented as a computer program. The input to the program consists of a circuit description and a list of possible failures as changes to the nominal unit under test. The output of the program consists of a report showing how well the failures can be isolated, the tests to be performed, and the ... |
|
| Naval Research Logistics Quarterly. Volume 25, Number 2. |
JUN 1978 |
|
| Authors:
OFFICE OF NAVAL RESEARCH ARLINGTON VA
|
|
| The Application of HOS to PLRS. |
NOV 1977 |
146 pages |
| Authors:
Margaret Hamilton; Saydean Zeldin; HIGHER ORDER SOFTWARE INC CAMBRIDGE MA
|
| The purpose of the PLRS project was to demonstrate the advantages of applying an effective methodology to a large system development process. A portion of the most complex module (the Network Manager) of the PLRS system was selected and that module was specified in terms of Higher Order Software (HOS), using the specification language, AXES, with graphical representation in terms of control maps. This module includes data type and control ... |
|
| Semiannual Review of Research under the Associate Joint Services Electronics Program. |
30 OCT 1977 |
|
| Authors:
R. Saeks; K. S. Chao; S. R. Liberty; D. Gustafson; J. Walkup; TEXAS TECH UNIV LUBBOCK INST FOR ELECTRONICS SCIENCE
|
| The following report represents the second semiannual review of research conducted under the auspices of the associate joint services electronics program at the institute for electronic science at Texas Tech University. Specific topics covered include fault analysis, computer-aided design, stochastic control and estimation, decentralized control, mathematical system theory, optical noise, and pattern recognition. (Author) |
|
| On the Design of Self-Checking Systems under Various Fault Models. |
OCT 1977 |
|
| Authors:
Jean Dussault; ILLINOIS UNIV AT URBANA-CHAMPAIGN COORDINATED SCIENCE LAB
|
| One of the objectives of this work is to study the design of totally self-checking systems that are made up of blocks whose fault behavior is different from one another. Consequently, different codes are mentioned and their associated circuit structures discussed in detail. Codes that are used to protect against unidirectional errors are studied. Systematic and non-systematic codes are shown to have the same basic structure. The structure of non-systematic ... |
|
| Safety Methodology for Space Nuclear Systems. |
OCT 1977 |
|
| Authors:
E. W. Holtzscheiter; Dermod Kelleher; G. W. Mitchell; Michael L. Crawford; J. A. Sholtis; AIR FORCE WEAPONS LAB KIRTLAND AFB N MEX
|
| Radioisotopic Thermoelectric/Thermodynamic Generator (RTG) systems are frequently used to power Department of Defense (DOD) and National Aeronautics and Space Administration (NASA) satellites. The launch of RTGs dictates that the user agency assure the Interagency Nuclear Safety Review Panel that risks to the populace are minimal and exposures below acceptable levels for any logically conceivable accident scenario and environment. Each agency (Energy Research and Development Administration (ERDA), NASA, and the DOD) ... |
|
| Methodology for System Safety Analysis |
11 AUG 1977 |
|
| Authors:
SPACE AND MISSILE SYSTEMS ORGANIZATION LOS ANGELES CA
|
| This standard tailors and interprets certain requirements of MIL-STD- 1574 and defines the methodology to be used to satisfy the analytical requirements imposed by that MIL Standard. The system safety analyses required by MIL-STD-1574 normally take the form (1) Preliminary Hazard Analysis (PHA), (2) Operating Hazard Analysis (OHA), (3) Fault Hazard Analysis (FHA), (4) Fault Tree Analysis (FTA), (5) Software Hazardous Effects Analysis (SHEA), and (6) Cable Failure Matrix (CFM). ... |
|
| The Software Security Problem and How to Solve It. Revision 1. |
JUL 1977 |
73 pages |
| Authors:
Steven Cushing; HIGHER ORDER SOFTWARE INC CAMBRIDGE MA
|
| There are many similarities between the requirements of security and the requirements of reliability. The Higher Order Software (HOS) methodology was developed as a means of guaranteeing system reliability and as such is an inherently secure system. HOS manages to solve these two problems of security and reliability by showing that they need not arise in the first place. If software is specified according to the principles of HOS, then ... |
|
| Preliminary Hazard Analysis for Automatic Life Raft System and Helicopter Flotation System. |
04 APR 1977 |
|
| Authors:
E. W. King; BOEING VERTOL CO PHILADELPHIA PA
|
| This document covers the preliminary hazard analysis (PHA) for the externally mounted, automatically expelled/inflated multiplace life raft system for helicopters (Automatic Life Raft System - ALRS), and the sink rate delay/improved in-water stability system for helicopters (Helicopter Flotation System - HFS). |
|
| The Use of Consensus in Analytical Safety. |
FEB 1977 |
|
| Authors:
M. L. Shooman; S. Sinkar; POLYTECHNIC INST OF NEW YORK BROOKLYN DEPT OF ELECTRICAL ENGINEERING AND ELECTROPHYSICS
|
| Sometimes hard, quotable data is not available for the purpose of reliability analysis. Some of the reasons for non-availability of data are: (a) Field data is improperly or not recorded at all; (b) Data is of a proprietary nature and cannot be released; (c) Newness of concept or design prevents one from having a recorded history of field experience; and (d) Failures occur with such a low frequency that many ... |
|
| Reliability Estimating Procedures for Electric and Thermochemical Propulsion Systems. Volume I. |
FEB 1977 |
298 pages |
| Authors:
BOOZ-ALLEN APPLIED RESEARCH BETHESDA MD
|
| The primary objective of this study was to develop a sound standardized basis for reliability comparisons of thermochemical and electric propulsion concepts applicable to Air Force satellite, spacecraft, and upper-stage mission requirements. A corollary objective was the identification of those propulsion system components which are currently the major contributors to propulsion system failures. Nearly one hundred component level and failure mode level models were developed in the course of the ... |
|
Reports by Keyword(s)
FAULT TREE ANALYSIS
