| Simplified Phased-Mission System Analysis for Systems with Independent Component Repairs |
MAR 96 |
27 pages |
| Authors:
Arun K. Somani; INSTITUTE FOR COMPUTER APPLICATIONS IN SCIENCE AND ENGINEERING HAMPTON VA
|
 | Accurate analysis of reliability of system requires that it accounts for all major variations in system's operation. Most reliability analyses assume that the system configuration, success criteria, and component behavior remain the same. However, multiple phases are natural. We present a new computationally efficient technique for analysis of phased-mission systems where the operational states of a system can be described by combinations of components states (such as fault trees or ... |
|
| Papers on Topology and Applications; Tenth Summer Conference at Amsterdam. Annuals of the New York Academy of Sciences, Volume 788 |
96 |
236 pages |
| Authors:
Eva Coplakova; Klaas P. Hart; NEW YORK ACADEMY OF SCIENCES NY
|
| The Tenth Summer Conference on General Topology and Applications was held August 15-18, 1994 at Vrije Universiteit, Amsterdam. There were four special sessions at the conference: (1) Continuum Theory and Dynamics, (2) Topology and Descriptive Set Theory, (3) Set Theoretic Topology, and (4) Infinite dimensional and Geometric Topology. In addition there were two minicourses: Topological Methods in Surface Dynamics and Topology and Descriptive Set Theory. |
|
| Automated Hyper-Liking in An Electronic Mathematical Proof-Check Journal |
96 |
42 pages |
| Authors:
Andrzej Trybulec; WARSAW TECHNICAL UNIV (POLAND) INST OF MATHEMATICS
|
| The main objective of the grant is to establish a hyper-linked electronic proof-check journal. The name of the journal is Journal of Formalized Mathematics (JFM). It is available at http://mizar.uw.bialystok.pl/JFM. JFM consists of articles written originally in Mizar and translated mechanically into English. The original articles written in Mizar are in a machine readable form (and they are mechanically processed at the semantic level). This facilitates automatic insertion of hyper-links ... |
|
| Conditional Event Algebras and Conditional Probability Logics. Basic Formulations and a Product Space Approach to Conditional Events |
NOV 95 |
38 pages |
| Authors:
Philip G. Calabrese; I. R. Goodman; NAVAL COMMAND CONTROL AND OCEAN SURVEILLANCE CENTER RDT AND E DIV SAN DIEGO CA
|
| Part 1 reports the somewhat mutually inconsistent treatments of 'if- then-' by logic and probability is recounted and used to motivate a formal axiomatic development of conditional propositions in terms of partially-defined measurable characteristic functions on a sample space. The characteristic function of a conditional proposition (a/b), a given b, indicates for each instance w in the sample space whether (1) (a/b) applies and is true for a), or (2) ... |
|
| Critical Failure Mode Analysis Of The Petite Amateur Navy Satellite (PANSAT) |
SEP 95 |
174 pages |
| Authors:
David W. Allridge; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| System reliability analysis is an essential element is the design process. A reliability study should proceed from system inception through final deployment. As the PANSAT project approaches the final design stage and begins initial flight production, the absence of any significant reliability analysis becomes increasingly troubling. This thesis initiates the program's reliability analysis obligation by investigating spacecraft failure modes. Typically referenced as critical failure modes, these events will cause complete ... |
|
| Optical Logic Gates with High Extinction Ratio using Inverse Scattering Technique and Method using Same. |
09 MAY 1995 |
|
| Authors:
Lakshman S. Tamil; Arthur K. Jordan; DEPARTMENT OF THE NAVY WASHINGTON DC
|
 | Optical logic gates are designed using inverse-scatteflng theory, resulting in devices which are intrinsic and passive, having high extinction ratios and large fan out. The Boolean operation is modeled by a pair of reflec tion coefficients, corresponding to the 1' and 0' states of the device. When inverse scattering theory is applied, each reflection coefficient yields a unique refractive index profile. The multivalued nature of the refractive index profile is ... |
|
| Applications of Multi-Terminal Binary Decision Diagrams |
APR 95 |
|
| Authors:
E. Clarke; M. Fujita; X. Zhao; CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE
|
| Functions that map boolean vectors into the integers are important for the design and verification of arithmetic circuits. MTBDDs and BMDs have been proposed for representing this class of functions. We discuss the relationship between these methods and describe a generalization called hybrid decision diagrams which is often much more concise. The Walsh transform and Reed-Muller transform have numerous applications in computer-aided design, but the usefulness of these techniques in ... |
|
| Digital Simulation of Organismal Growth. |
17 MAR 1995 |
16 pages |
| Authors:
John W. Bodnar; DEPARTMENT OF THE NAVY WASHINGTON DC
|
| The growth and development of a biological organism reflected as a series of molecular and cellular processes by chromatin switching networks form threshold mechanisms applied through Boolean logic rules to pattern formations of a digital approximation of regulator concentration gradient. Digital logic statements are derived from such pattern formations to simulate the growth and development of the organism. |
|
| Teaching Mathematics to Software Engineers |
21 FEB 95 |
24 pages |
| Authors:
Jeannette M. Wing; CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE
|
| Based on my experience in teaching formal methods to practicing and aspiring software engineers, I present some of the common stumbling blocks faced when writing formal specifications. The most conspicuous problem is learning to abstract. I address all these problems indirectly by giving a list of hints to specifiers. Thus this paper should be of interest not only to teachers of formal methods but also to their students. (AN) ... |
|
| Lecture Notes in Computer Science 960. Logic and Computational Complexity. International Workshop Held in Indianapolis, Indiana on October 1994. Selected Papers |
OCT 94 |
526 pages |
| Authors:
Daniel Leivant; G. Goos; J. Hermanis; J. Van Leeuwen; INDIANA UNIV AT BLOOMINGTON DEPT OF COMPUTER SCIENCE
|
|
| Wavelength-Encoded Processing in Semiconductor Lasers |
JUN 94 |
|
| Authors:
M. Dagenais; MARYLAND UNIV COLLEGE PARK DEPT OF ELECTRICAL ENGINEERING
|
| It was the goal of this proposal to study the process of wavelength conversion and wavelength encoded processing in semiconductor laser types of devices. In particular, we report on (1) the implementation of Boolean logic using wavelength encoded inputs, (2) the use of frequency modulation to control the transmission of a Fabry-Perot laser, (3) nonlinear spectral filtering of a multi-wavelength signal, (4) wavelength-conversion and logic operation based on bistable diode ... |
|
| Haskell-style Overloading is NP-hard |
01-May-1994 |
8 pages |
| Authors:
Dennis M Volpano; NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF COMPUTER SCIENCE
|
| Extensions of the ML type system, based on constrained type schemes, have been proposed for languages with overloading. Type inference in these systems requires solving the following satisfiability problem. Given a set of type assumptions C over finite types and a type basis A, is there is a substitution S that satisfies C in that A assertion CS is derivable? Under arbitrary overloading, the problem is undecidable. Haskell limits overloading ... |
|
| Using Local Optimality Criteria for Efficient Information Retrieval with Redundant Information Filters |
MAR 94 |
48 pages |
| Authors:
Neil C. Rowe; NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF COMPUTER SCIENCE
|
| We consider information retrieval when the data, for instance multimedia, is computationally expensive to fetch. Our approach uses information filters to considerably narrow the universe of possibilities before retrieval. Then decisions must be made about the necessity, order, and concurrent processing of proposed filters (an execution plan ). We develop simple polynomial-time local criteria for optimal execution plans, and show that most forms of concurrency are suboptimal with information filters. ... |
|
| A Theory of Conditional Information with Applications |
MAR 94 |
12 pages |
| Authors:
P. G. Calabrese; NAVAL COMMAND CONTROL AND OCEAN SURVEILLANCE CENTER RDT AND E DIV SAN DIEGO CA
|
| The development of conditional propositions, deduction between conditionals, and boolean-like operations on conditionals, and their associated probabilities are here unified in terms of boolean relations of the form B = O defined on an initially relation-free algebra of boolean polynomials that transcend an initial domain of discourse. The conditional proposition (a/b) is assigned the conditional probability P(a/b), which is different from the probability that (a/b) is a tautology. The resulting ... |
|
| Application of Genetic Algorithms to Function Decomposition in Pattern Theory |
26 JAN 1994 |
84 pages |
| Authors:
Michael J. Noviskey; Timothy D. Ross; David A. Gadd; Mark Axtell; WRIGHT LAB WRIGHT-PATTERSON AFB OH AVIONICS DIRECTORATE
|
| This report documents use of genetic algorithms for finding partitions which lead to optimal decomposition of boolean functions in the Ashenhurst-Curtis method of functional decomposition. This problem apparently grows exponentially as the number of input variables increase, but is useful to study since it has a myriad of potential applications in algorithm design, circuit design, image processing, data compression, logic minimization, and machine learning. The report presents some background on ... |
|
| Software Merge: Semantics of Combining Changes to Programs |
94 |
30 pages |
| Authors:
Valdis Berzins; NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF COMPUTER SCIENCE
|
| We present a language-independent semantic model of the process of combining changes to programs. This model extends the domains used in denotational semantics (complete partial orders) to Boolean algebras, and represents incompatible modifications as well as compatible extensions. The model is used to define the intended semantics of change merging operations on programs and to establish some general properties of software merging. We determine conditions under which changes to subprograms ... |
|
| Software Merge: Semantics of Combining Changes to Programs |
DEC 93 |
33 pages |
| Authors:
Valdis Berzins; NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF COMPUTER SCIENCE
|
| We present a language-independent semantic model of the process of combining changes to programs. This model extends the domains used in denotational semantics (complete partial orders) to Boolean algebras, and represents incompatible modifications as well as compatible extensions. The model is used to define the intended semantics of change merging operations on programs and to establish some general properties of software merging. We determine conditions under which changes to subprograms ... |
|
| Graphs and Matrices: Combinatorial Analysis, Competitions, Covers and Ranks |
30 SEP 93 |
4 pages |
| Authors:
J. R. Lundgren; John S. Maybee; COLORADO UNIV AT DENVER
|
|
| On Modeling of If-Then Rules for Probabilistic Inference |
FEB 93 |
13 pages |
| Authors:
I. R. Goodman; H. T. Nguyen; NAVAL COMMAND CONTROL AND OCEAN SURVEILLANCE CENTER RDT AND E DIV SAN DIEGO CA
|
| We identify various situations in probabilistic intelligent systems in which conditionals (rules) as mathematical entities as well as their conditional logic operations are needed. In discussing Bayesian updating procedure and belief function construction, we provide a new method for modeling if...then rules as Boolean elements, and yet, compatible with conditional probability quantifications. |
|
| Expressing Boolean Cube Matrix Algorithms in Shared Memory Primitives |
93 |
29 pages |
| Authors:
S. L. Johnsson; Ching-Tien Ho; THINKING MACHINES CORP CAMBRIDGE MA
|
| In this paper the focus is on expressing the algorithms in shared memory type primitives. We assume that all processors share the same global address space, and present communication primitives both for nearest neighbor communication, and global operations such as broadcasting from one processor to a set of processors, the reverse operation of plus reduction, and matrix transposition. |
|
| Predicates and Predicate Transformers for Supervisory Control of Discrete Event Dynamical Systems |
21 JUL 1992 |
33 pages |
| Authors:
Ratnesh Kumar; Vijay Garg; Steven I. Marcus; MARYLAND UNIV COLLEGE PARK SYSTEMS RESEARCH CENTER
|
| Most discrete event system models are based on defining the alphabet set or the set of events as a fundamental concept. This paper takes an alternative view of treating the state space as the fundamental concept. We approach the problem of controlling discrete event systems by using predicates and predicate transformers. Predicates have the advantage that they can concisely characterize an infinite state space. The notion of controllability of a ... |
|
| GEO Modules and All-Optical Time Slot Interchangers, |
22 MAY 1992 |
|
| Authors:
C. E. Soccolich; M. N. Islam; AT AND T BELL LABS HOLMDEL NJ
|
| We design an all-optical time slot interchanger using Generalized Exclusive-Or modules, which are boolean and connectivity complete logical abstractions of soliton dragging logic gates. Time difference techniques are used to implement a feed-forward time-slot interchanger that does not require memory or feedback. |
|
| Optoelectronic Fuzzy Logic System, |
22 MAY 1992 |
|
| Authors:
Gary C. Marsden; Brita Olson; Sadik Esener; Sing H. Lee; CALIFORNIA UNIV SAN DIEGO LA JOLLA DEPT OF ELECTRICAL AND COMPUTER ENGINEERIN G
|
| It is often the case in reasoning problems that propositions are neither entirely true nor entirely false. In fuzzy logic, the truth values of propositions are not restricted to true or false, but rather may range between zero (absolutely false) and one (absolutely true), allowing a quantitative representation and evaluation of vague propositions. For example, the proposition, 'Marsden is a boring speaker' is neither totally true nor totally false, but ... |
|
| Boolean Reasoning and Informed Search in the Minimization of Logic Circuits |
MAR 92 |
610 pages |
| Authors:
James J. Kainec; AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH
|
| The minimization of logic circuits has been an important area of research for more than a half century. The approaches taken in this field, however, have for the most part been ad hoc. Boolean techniques have been employed to manipulate formulas, but not to perform symbolic reasoning. Boolean equations are employed principally as icons; they are never solved. The first objective of this dissertation is to apply Boolean reasoning systematically ... |
|
| Global Optimization of Digital Circuits |
DEC 91 |
|
| Authors:
Richard Flandera; AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING
|
| This thesis was divided into two tasks. The first task involved developing a parser which could translate a behavioral specification in Very High-Speed Integrated Circuits (VHSIC) Hardware Description Language (VHDL) into the format used by an existing digital circuit optimization tool, BOolean Reasoning In Scheme (BORIS). Since this toll is written in Scheme, a dialect of Lisp, the parser was also written in Scheme. The parser was implemented is Artez's ... |
|
| A Library of Failure Regions |
06 SEP 91 |
|
| Authors:
Timothy J. Shimeall; NAVAL POSTGRADUATE SCHOOL MONTEREY CA DEPT OF COMPUTER SCIENCE
|
| A failure region is the set of all possible program inputs that will execute a specific fault and produce a result that varies from the specified or expected program result. The purpose of this report is to document a set of failure regions corresponding to the known faults in a set of redundant program versions. Each failure region is characterized in two ways: by identifying the fault that it reveals ... |
|
| Boolean Algebra Applied to Determination of Universal Set of Knowledge States |
AUG 91 |
44 pages |
| Authors:
Kikumi K. Tatsuoka; EDUCATIONAL TESTING SERVICE PRINCETON NJ
|
| Diagnosing cognitive errors possessed by examinees can be considered as a pattern classification problem which is designed to classify a sequential input of stimuli into one of several predetermined groups. The sequential inputs in our context are item responses and the predetermined groups are various states of knowledge resulting from misconceptions or different degrees of incomplete knowledge in a domain. In this study, the foundations of a combinatorial algorithm that ... |
|
| An Algebraic Approach to Conditioning in Probability with Applications to the Combination of Evidence Problem |
AUG 91 |
2 pages |
| Authors:
I. R. Goodman; NAVAL OCEAN SYSTEMS CENTER SAN DIEGO CA
|
| This presentation considers a fundamental problem touching upon four major disciplines: probability theory, boolean algebra and logic, ring theory, and the modeling of natural and formal language in expert systems. Specifically, this lecture treats the problem of annexing a conditional event operator to boolean algebra-as originally proposed by Boole and long neglected in the standard semantically oriented literature-which is compatible with all conditional probability evaluations, and which allows for the ... |
|
| Conditional Event Algebras: Two New Characterizations and Their Relations to Bayesian Analysis |
AUG 91 |
2 pages |
| Authors:
I. R. Goodman; NAVAL OCEAN SYSTEMS CENTER SAN DIEGO CA
|
| The standard approach in developing conditional probability is a numerically oriented one, although one notable exception has been efforts in the area of qualitative (comparative-preference ordering) probability theory, as developed by Suppes, Domotor, Fishburn, and others. However, the latter aspect of probability requires, in general, the preference ordering to be equivalent to the probability ordering. But, this is obviously too restrictive to be compatible with the basic monotonicity property of ... |
|
| Deduction and Inference Using Conditional Logic and Probability |
MAY 91 |
32 pages |
| Authors:
P. G. Calabrese; NAVAL OCEAN SYSTEMS CENTER SAN DIEGO CA
|
| In contrast to the author's 1987 paper, which presented an algebraic synthesis of conditional logic and conditional probability starting with an initial Boolean algebra of propositions,this paper starts with an initial probability space of events and generates the associated propositions as measurable indicator functions (a la the approach of B. De Finetti). Conditional propositions are generated as measureable indicator functions restricted to subset of positive probability measure. The operations of ... |
|
| Recursive Optimization of Digital Circuits |
14 DEC 90 |
308 pages |
| Authors:
John Knutson; AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING
|
| The goal of this thesis is twofold: first, to identify the advantages and disadvantages of existing optimization systems and second, to develop an optimization system that uses Boolean principles to generate a recursive realization of combinational logic. Current multi-level optimization systems fall into two categories: local optimization which removes redundancy by pattern matching on a local scale and global optimization which works with the equations that specify a circuit rather ... |
|
| Triangularization: A Two-Processor Scheduling Problem |
OCT 90 |
126 pages |
| Authors:
Ramsey W. Haddad; STANFORD UNIV CA DEPT OF COMPUTER SCIENCE
|
| We explore the following matrix problem: Given an n x n boolean matrix, is there a permutation of the rows and a permutation of the columns such that the resulting matrix is lower triangular? We show the relationship of this matrix problem to the two important scheduling problems: optimization of code for pipelined execution and microcode compaction for very long instruction computers. This matrix problem is unclassified-it is unknown whether ... |
|
| Anisotropic Tensile Probabilistic Failure Criterion for Composites |
JUN 90 |
161 pages |
| Authors:
Scott J. McKernan; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| A probabilistic failure criterion is needed to quantitatively predict reliability in critical applications, such as man-safe, deep-sea and air structures, and as an objective function for use in optimum design. Composites are multi-phased and anisotropic, which gives rise to failure in different modes with different probabilistic occurrences that are dependent on the applied stress tensor. Statistical representation of combines stress failure is practically impossible. Probabilistic modeling must be based on ... |
|
| Primer and Analysis to EM-TRANAIR Code Execution |
31 MAY 90 |
64 pages |
| Authors:
Gregory S. Meserve; WRIGHT RESEARCH AND DEVELOPMENT CENTER WRIGHT-PATTERSON AFB OH
|
| EM-TRANAIR is a computer program for solving Maxwell's equations in three dimensions. This primer on EM-TRANAIR installation at WRDC and guide to confronted execution problems will aid in understanding the internals of EM- TRANAIR. Successful pathways for accurate converged numerical solutions are possible. The architecture of EM-TRANAIR is briefly presented in a discussion of various installation problems encountered when moving from a CFT compiler to a CFT77 compiler. Compilation problems ... |
|
| Computer Assisted Analysis and Modelling of Structured Problems |
29 MAY 90 |
17 pages |
| Authors:
E. Hadjiconstantinou; G. Mitra; BRUNEL UNIV UXBRIDGE (UNITED KINGDOM)
|
| Our research efforts are focused on developing a systematic procedure for transforming a set of logical conditions imposed on a mathematical optimisation model into an integer linear programming formulation. Through reformulation of logical forms into integer forms we support a uniform and powerful representation of a problem, consisting of a tightly interrelated closed system of choices. We describe a systematic approach for transforming statements in Boolean Algebra into integer or ... |
|
| An Expert System for Searching in Full-Text |
DEC 89 |
131 pages |
| Authors:
Susan Gauch; NORTH CAROLINA UNIV AT CHAPEL HILL DEPT OF COMPUTER SCIENCE
|
| This dissertation explores techniques to improve full text information retrieval by experienced computer users who are novice users of retrieval systems. An expert system which automatically reformulates Boolean user queries to improve search results is presented. The expert system differs from other intelligent database functions in two ways: it works with semantically and syntactically unprocessed text; and the expert system contains a knowledge base of domain independent search strategies. The ... |
|
| An Artificial Intelligence Approach to Analog System Diagnosis |
22 SEP 89 |
29 pages |
| Authors:
F. J. Pipitone; K. A. DeJong; W. M. Spears; NAVAL RESEARCH LAB WASHINGTON DC
|
| This report describes techniques for the automatic diagnosis of primarily analog systems. These results were obtained after several years of work at NRL in this area, along with a fully implemented research prototype diagnosis system, FIS (Fault Isolation System). Key features are a local qualitative causal model of replaceable module behavior, the absence of the single fault assumption, a rigorous probabilistic treatment of fault probabilities, dynamic best test selection based ... |
|
| Optimal Layout via Boolean Satisfiability |
SEP 89 |
6 pages |
| Authors:
Srinivas Devadas; MASSACHUSETTS INST OF TECH CAMBRIDGE MICROSYSTEMS TECHNOLOGY LABS
|
| Most optimization problems in layout have been shown to be NP- complete, resulting in researchers abandoning the search for optimum solutions even for small-scale problem instances. In this paper we transform various NP- complete problems in layout, namely two-and multi-layer dogleg routing, two-way partitioning, one-dimensional and two-dimensional placement, into Boolean satisfiability problems. The transformations are efficient in that the number of inputs to the Boolean function, for which we have ... |
|
| Automatic Runtime Consistency Checking and Debugging of Formally Specified Programs |
AUG 89 |
212 pages |
| Authors:
Sriram Sankar; STANFORD UNIV CA DEPT OF COMPUTER SCIENCE
|
| This thesis studies an approach to automate the process of deciding whether a program is performing correctly, and if not, to discover the probable cause of the problem. It assumes that the intended program's behavior is specified in some formal, high-level specification language. It studies how one can check automatically at runtime whether the program is running consistently with its specification, and if not, how inconsistencies can be automatically detected ... |
|
| A Diagnostic System Using Boolean Reasoning |
DEC 88 |
371 pages |
| Authors:
James J. Kainec; AIR FORCE INST OF TECH WRIGHT-PATTERSON AFB OH SCHOOL OF ENGINEERING
|
| The goal of this thesis is to design and implement a computer aided diagnostic system for combinational circuits, a type of circuit used in the design of all computers. The diagnostic system is to accept a description of the circuit, supervise an adaptive input-output experiment on a potentially faulty implementation of the circuit, and return the locations of all faults in the circuit. The description of the circuit which will ... |
|
| Parallel Restructuring and Evaluation of Expressions |
OCT 88 |
29 pages |
| Authors:
D. E. Muller; F. P. Preparata; ILLINOIS UNIV AT URBANA COLL OF ENGINEERING
|
| This paper describes a boolean network of size O(N squared log N) which accepts a fully parenthesized N-variable expression over a given semiring and produces its value in O(log N) time. The network consists of two components: a preprocessor and a universal evaluator. The preprocessor computes the destinations of the expression terms and routes them to the correct input terminals of the universal evaluator. The evaluation of tree-structured expressions is ... |
|
| Optics and Symbolic Computing |
APR 88 |
32 pages |
| Authors:
Athale; BDM CORP MCLEAN VA
|
| Many problems in Artificial Intelligence are intractable due to the exponential growth of the solution space with problem size. Often these problems can benefit from heuristic search or forward-checking techniques which attempt to prune the search space down to a manageable size before or during the actual search procedure. Many interesting search problems can be formulated as consistent labeling problem in which initial problem information is given in the form ... |
|
| An Expert System Model Using Predicate Transition Nets |
JAN 88 |
|
| Authors:
Didier M. Perdu; Alexander H. Levis; MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR INFORMATION AND DECISION SYSTEMS
|
| A Predicate Transition Net model of expert systems with fuzzy logic is proposed as a means for dealing with uncertainty. Attention is focused on consultant expert systems which use the production rules formalism to represent knowledge. Models of the basic fuzzy logical operators are presented base on the Predicate Transition Nets formalism. The combination of these operators allows to represent the links among the rules of a knowledge base and ... |
|
| A Graph Separator Theorem and Its Application to Gaussian Elimination to Optimize Boolean Expressions for Parallel Evaluation |
DEC 87 |
|
| Authors:
Thomas J. Sheffler; CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE
|
| Gaussian elimination, which has been shown to be applicable to the solution problems in many different domains, is the technique used by COSMOS to symbolically analyze digital MOS networks for their behavior in terms of Boolean expressions. While pivot selection algorithms are known which minimize the total number of operations required to solve a system, this report will focus on pivot selection algorithms that result in expressions of small depth, ... |
|
| The Avoidance of Collisions for Newtonian Bodies with Hidden Variables |
OCT 87 |
|
| Authors:
B. D. Bramson; ROYAL SIGNALS AND RADAR ESTABLISHMENT MALVERN (ENGLAND)
|
| The collision avoidance of a pair of uniformly moving bodies is considered in three dimensions. The relative motion of the bodies yields an expression relating the time to closet approach, the minimum range, the current range and its rate of change, other variables being unobservable. A Boolean relation is then proposed that is satisfied whenever the minimum range and time to closet approach simultaneously fall below given thresholds. The relation ... |
|
| Theoretical Investigation of Optical Computing Based on Neural Network Models |
29 SEP 87 |
|
| Authors:
Yaser Abu-Mostafa; Demetri Psaltis; CALIFORNIA INST OF TECH PASADENA DEPT OF ELECTRICAL ENGINEERING
|
| It is difficult to find good mathematical models for many natural problems such as pattern recognition. Not only does this difficulty preclude finding good solutions for these problems, but it also precludes estimating their complexity using the standard tools of the theory oc computational complexity (Traub, 1985). Part of the difficulty can be traced to symptoms such as ill-definition, fuzziness, and inexactness. However, the difficulty of modeling these problems may ... |
|
| Boolean and Graph Theoretic Formulation of the Simple Plant Location Problem |
AUG 87 |
|
| Authors:
P. M. Dearing; P. L. Hammer; B. Simeone; NAVAL POSTGRADUATE SCHOOL MONTEREY CA
|
| The simple plant location problem is formulated as the minimization of a pseudo-Boolean functions. This form of the problem is then transformed into a set covering problem and also into a weighted vertex packing problem on a graph. These formulations are compared to similar formulations in the literature and to the 'standard' integer programming formulation. (Author) |
|
| Efficient Parallel Circuits and Algorithms for Division |
JUN 87 |
|
| Authors:
Narayan Shankar; Vijaya Ramachandran; ILLINOIS UNIV AT URBANA APPLIED COMPUTATION THEORY GROUP
|
| We improve the size bound for parallel circuits and algorithms for the division problem. Keywords include: Division, Boolean circuits, PRAM algorithms for the division problem. |
|
| Morphological Filters. Part 2. Their Relations to Median, Order-Statistic, and Stack Filters |
24 MAR 1987 |
44 pages |
| Authors:
Petros Maragos; Ronald W. Schafer; HARVARD UNIV CAMBRIDGE MA DIV OF APPLIED SCIENCES
|
| This paper extends the theory of median, order-statistic (OS), and stack filters by using mathematical morphology to analyze them and by relating them to those morphological erosions, dilations, openings, closings, and open-closings that commute with thresholding. The max-min representation of OS filters is introduced by showing that any median or other OS filter is equal to a maximum of erosions (moving local minima) and also to a minimum of dilations' ... |
|
| A New Multi-Decoder PLA Design |
MAR 87 |
|
| Authors:
Adly T. Fan; Mathew R. Vitallo; Mark T. Pronobis; STATE UNIV OF NEW YORK AT BUFFALO AMHERST
|
| A multi-decoder design for Programmable Logic Array devices is introduced and found to be both two decoder ROM and single decoder PLA devices in implementing a special class of Boolean expressions. In this class, the logic expressions may be lengthy but are restricted in the number of input variables comprising each p-term. A theoretical analysis of the area efficiency of the new design is supplemented by CAD design examples which ... |
|
Reports by Keyword(s)
BOOLEAN ALGEBRA
