Journal ArticleDOI
The synthesis of two-terminal switching circuits
Reads0
Chats0
TLDR
A basic part of the general synthesis problem is the design of a two-terminal network with given operating characteristics, and this work shall consider some aspects of this problem.Abstract:
THE theory of switching circuits may be divided into two major divisions, analysis and synthesis. The problem of analysis, determining the manner of operation of a given switching circuit, is comparatively simple. The inverse problem of finding a circuit satisfying certain given operating conditions, and in particular the best circuit is, in general, more difficult and more important from the practical standpoint. A basic part of the general synthesis problem is the design of a two-terminal network with given operating characteristics, and we shall consider some aspects of this problem.read more
Citations
More filters
Dissertation
Algebraic minimization and the design of two-terminal contact networks
TL;DR: Thesis (Sc.D.) Massachusetts Institute of Technology, 1956 as discussed by the authors, Dept. of Electrical and Computer Engineering, Boston, Massachusetts, United States of America, USA....
Posted Content
The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs.
Amos Beimel,Oriol Farràs +1 more
TL;DR: Almost all access structures have a secret-sharing scheme with share size 2 √ and it is shown that for almost all graphs, the share size of each party is n.
Journal ArticleDOI
Enumeration of Fanout-Free Boolean Functions
TL;DR: It is shown that for large n
Journal ArticleDOI
A Boolean Analysis of Interpersonal Perception
TL;DR: In this article, a logical and rigorous substructure for the Personal Perception Method (IPM) has been proposed, which allows it to be developed as a general method for the study of interdependent dyads.
Journal ArticleDOI
Optimal bounds for the approximation of boolean functions and some applications
TL;DR: An optimal bound on the Shannon function L(n,m,e) that gives the worstcase circuit-size complexity to approximate, within an approximation degree at least e, partial boolean functions having n inputs and domain size m is presented.
References
More filters
Journal ArticleDOI
A logical calculus of the ideas immanent in nervous activity
Warren S. McCulloch,Walter Pitts +1 more
TL;DR: In this article, it is shown that many particular choices among possible neurophysiological assumptions are equivalent, in the sense that for every net behaving under one assumption, there exists another net which behaves under another and gives the same results, although perhaps not in the same time.
Journal ArticleDOI
A symbolic analysis of relay and switching circuits
TL;DR: It will be shown that several of the well-known theorems on impedance networks have roughly analogous theorem in relay circuits, including the delta-wye and star-mesh transformations, and the duality theorem.
Book
The axiomatic method in biology
TL;DR: Interestingly, the axiomatic method in biology that you really wait for now is coming, and it's significant to wait for the representative and beneficial books to read.
Journal ArticleDOI
The Number of Two-Terminal Series-Parallel Networks
John Riordan,Claude E. Shannon +1 more