Boolean algebra
1,391 resources related to Boolean algebra
IEEE Organizations related to Boolean algebra
Back to TopConferences related to Boolean algebra
Back to Top2013 16th International Conference on Information Fusion  (FUSION 2013)
Scope of the conference is to provide medium to discuss advances and applications of fusion methodologies. Conference will include contributions in the areas of fusion methodologies, theory and representation, algorithms and modelling and simulation.
2012 11th Symposium on Neural Network Applications in Electrical Engineering (NEUREL 2012)
The NEUREL conferences have been organized as a biennial events to allow scientists, experts, and engineers working in diverse areas to report their recent research in the field of neural networks and fuzzy systems, and to contribute to their applications, mainly, but not only, in electrical engineering.
2012 5th International Workshop on Soft Computing Applications (SOFA)
After four successful editions, the 5th IEEE SOFA is moving to Szeged  Hungary, where it aims to gather as many Soft Computing (SC) researchers and professionals as possible. The main goal of the Workshop is to communicate and publish new theoretical and applicative research results, in the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, and other methods belonging or connected to SC. A second and just as important goal is to encourage new reflections on SC issues and new links between interested researchers, R&D engineers, managers, etc.
2012 IEEE International Conference on Granular Computing (GrC2012)
IEEE GrC 2012 will continue to address the issues related to Granular Computing and its applications. IEEE GrC 2012 will provide researchers from universities, laboratories and industry to present stateoftheart research results and methodologies in theory and applications of granular computing. The conference will also make it possible for researchers and developers to highlight their new research directions and new interactions with novel computing models. To broaden more impact on granular computing and its applications, IEEE GrC 2012 will focus on currently important major research tracks such as soft computing (fuzzy, rough sets and etc), social network, cloud computing, eintelligence (web intelligence, semantic web), bioinformatics and medical informatics.
2011 9th IEEE International Conference on Control and Automation (ICCA)
IEEE ICCA 2001 aims to create a forum for scientists and practicing engineers throughout the world to present the latest research findings and ideas in the areas of control and automation.
More Conferences
Periodicals related to Boolean algebra
Back to TopComputational Biology and Bioinformatics, IEEE/ACM Transactions on
Specific topics of interest include, but are not limited to, sequence analysis, comparison and alignment methods; motif, gene and signal recognition; molecular evolution; phylogenetics and phylogenomics; determination or prediction of the structure of RNA and Protein in two and three dimensions; DNA twisting and folding; gene expression and gene regulatory networks; deduction of metabolic pathways; microarray design and analysis; proteomics; ...
Computers, IEEE Transactions on
Design and analysis of algorithms, computer systems, and digital networks; methods for specifying, measuring, and modeling the performance of computers and computer systems; design of computer components, such as arithmetic units, data storage devices, and interface devices; design of reliable and testable digital devices and systems; computer networks and distributed computer systems; new computer organizations and architectures; applications of VLSI ...
Xplore Articles related to Boolean algebra
Back to TopCombining evidences by means of the entropy maximization principle
Frederic Dambreville 2007 10th International Conference on Information Fusion, 2007
Works have investigated the problem of the conflict redistribution in the fusion rules of evidence theories. As a consequence of these works, many new rules have been proposed. Now, there is not a clear theoretical criterion for a choice of a rule instead another. The present paper proposes a new theoretically grounded rule, based on a new concept of sensor ...
Inequalities in De Morgan systems. I
C. Walker; E. Walker Fuzzy Systems, 2002. FUZZIEEE'02. Proceedings of the 2002 IEEE International Conference on, 2002
In a Boolean algebra, every element has two canonical forms, its disjunctive normal form (BDNF) and its conjunctive normal form (BCNF). If these elements are viewed in the algebra consisting of the unit interval with operations min, max, and the usual negation, the inequality BDNF⩽BCNF always holds. If the operations min and max in this algebra are replaced by a ...
V. F. Kravchenko; M. A. Basarab 2005 5th International Conference on Antenna Theory and Techniques, 2005
The report consists from the following two parts. In the first part, application of the constructive approximation theory on the base of the atomic functions to problems of antenna analysis and synthesis. New methods of signal approximation with the help of compactly supported atomic functions and the WhittakerKotel'nikovShannon theorem are considered and justified. The second part of the report is ...
Automata, tableaus and a reduction theorem for fixpoint calculi in arbitrary complete lattices
D. Janin Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, 1997
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notion of automaton is defined and shown, by means of a tableau technique, to capture the expressive power of fixpoint expressions. For interpretation over continuous and complete lattices when, moreover, the meet symbol Λ commutes in a rough sense with all other functional symbols, it ...
Petri subnets for minpathbased fault trees
W. G. Schneeweiss Annual Reliability and Maintainability Symposium. 2001 Proceedings. International Symposium on Product Quality and Integrity (Cat. No.01CH37179), 2001
The choice of proper forms of fault tree (FT) and success tree (ST) representations, respectively inside of Petri nets (PNs) in the field of R&M modeling is not a trivial problem, because there is the danger of stray tokens inside of the subPNs of those trees which would disturb the system model's proper operation in the long run. The author ...
More Xplore Articles
Educational Resources on Boolean algebra
Back to TopeLearning
Combining evidences by means of the entropy maximization principle
Frederic Dambreville 2007 10th International Conference on Information Fusion, 2007
Works have investigated the problem of the conflict redistribution in the fusion rules of evidence theories. As a consequence of these works, many new rules have been proposed. Now, there is not a clear theoretical criterion for a choice of a rule instead another. The present paper proposes a new theoretically grounded rule, based on a new concept of sensor ...
Inequalities in De Morgan systems. I
C. Walker; E. Walker Fuzzy Systems, 2002. FUZZIEEE'02. Proceedings of the 2002 IEEE International Conference on, 2002
In a Boolean algebra, every element has two canonical forms, its disjunctive normal form (BDNF) and its conjunctive normal form (BCNF). If these elements are viewed in the algebra consisting of the unit interval with operations min, max, and the usual negation, the inequality BDNF⩽BCNF always holds. If the operations min and max in this algebra are replaced by a ...
V. F. Kravchenko; M. A. Basarab 2005 5th International Conference on Antenna Theory and Techniques, 2005
The report consists from the following two parts. In the first part, application of the constructive approximation theory on the base of the atomic functions to problems of antenna analysis and synthesis. New methods of signal approximation with the help of compactly supported atomic functions and the WhittakerKotel'nikovShannon theorem are considered and justified. The second part of the report is ...
Automata, tableaus and a reduction theorem for fixpoint calculi in arbitrary complete lattices
D. Janin Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, 1997
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notion of automaton is defined and shown, by means of a tableau technique, to capture the expressive power of fixpoint expressions. For interpretation over continuous and complete lattices when, moreover, the meet symbol Λ commutes in a rough sense with all other functional symbols, it ...
Petri subnets for minpathbased fault trees
W. G. Schneeweiss Annual Reliability and Maintainability Symposium. 2001 Proceedings. International Symposium on Product Quality and Integrity (Cat. No.01CH37179), 2001
The choice of proper forms of fault tree (FT) and success tree (ST) representations, respectively inside of Petri nets (PNs) in the field of R&M modeling is not a trivial problem, because there is the danger of stray tokens inside of the subPNs of those trees which would disturb the system model's proper operation in the long run. The author ...
More eLearning Resources
IEEEUSA EBooks

Appendix A: Counting in Base 2
This book explains, in lay terms, the surprisingly simple system of mathematical logic used in digital computer circuitry. Anecdotal in its style and often funny, it follows the development of this logic system from its origins in Victorian England to its rediscovery in this century as the foundation of all modern computing machinery. ONES AND ZEROS will be enjoyed by anyone who has a general interest in science and technology.

This book explains, in lay terms, the surprisingly simple system of mathematical logic used in digital computer circuitry. Anecdotal in its style and often funny, it follows the development of this logic system from its origins in Victorian England to its rediscovery in this century as the foundation of all modern computing machinery. ONES AND ZEROS will be enjoyed by anyone who has a general interest in science and technology.

This chapter contains sections titled: AND and NOT Grouping with Parentheses AND and OR with More Than Two Inputs Algebraic Examples of ArbitraryInput AND and OR Functions Truth Tables for ArbitraryInput AND and OR Functions Creating ArbitraryInput AND and OR Gates from the Old TwoInput Kind An ArbitraryInput AND Gate An ArbitraryInput OR Gate

This chapter contains sections titled: Introduction to Digital Circuits Binary Numbers: a Quick Introduction Boolean Algebra Minterms: Standard or Canonical Sum of Products (SOP) Form Maxterms: Standard or Canonical Product of Sums (POS) Form Karnaugh Maps and Design Examples Product of Sums Simplifications Don't Care Conditions Logic Gates: Electrical and Timing Characteristics Summary Further Reading Problems

This book explains, in lay terms, the surprisingly simple system of mathematical logic used in digital computer circuitry. Anecdotal in its style and often funny, it follows the development of this logic system from its origins in Victorian England to its rediscovery in this century as the foundation of all modern computing machinery. ONES AND ZEROS will be enjoyed by anyone who has a general interest in science and technology.

Switching theory is concerned with the development of models and techniques for the analysis and synthesis of those circuits in which information is represented in discrete or digital form, as opposed to the analog form in which information is represented in a continuous manner. The application of digital techniques over a wider range of human activities has already profoundly affected modern life, and there is no visible limit to their future utility.This book is the outgrowth of a course on switching circuits that the author has taught since 1960, and it is designed as a text to provide a unified treatment of the subject with particular emphasis on sequential circuit theory. An attempt has been made to include only those techniques that have been generally accepted and seem to have lasting application.The first four of the nine chapters are devoted to basic principles and to combinational circuit theory. They introduce number systems, binary codes, Boolean algebra, switching functions, the analysis and synthesis of combinational gate circuits (including NAND, NOR, EXCLUSIVEOR, and EXCLUSIVENOR), and threshold logic, among other topics. Also covered are algebraic, geometric, and tabular techniques for the minimization of algebraic expressions.The remainder of this book is on sequential circuit theory. A general treatment is emphasized by classification of the sequentialcircuit operation as either fundamental mode or pulse mode, and as either clocked or not clocked. A comparison of the two modes is enhanced by design examples in which the same problem specifications are used for each mode. Both algebraic and tablular techniques are presented for the analysis and synthesis of these circuits. The timely topics of control states and register transfers in sequential desi gn are included. The book closes with a discussion of sequentialcircuit minimization associated with the reduction of flow tables, and the stateassignment problem.Answers are provided to selected problems.

This chapter contains sections titled: Sets of Axioms Perfect Induction Deduction Allowed Manipulations of Boolean Equations Principle of Duality

This chapter contains sections titled: Mathematical Model, Boolean Algebra, Application of Boolean Algebra, Theorems in n Variables, Manipulation of Algebraic Expressions, Canonical Function Forms, Some Additional Remarks, Suggested Reading, Problems

Realizing Any Boolean Function with AND, OR, and NOT
This chapter contains sections titled: Minterms Realizing Any Boolean Function Using Minterms SumofProducts Expressions The SevenSegment Display Maxterms Realizing any Boolean Function with Maxterms ProductofSums Expressions The ThreeInput Majority Voter

The Algebra of Sets and Venn Diagrams
This chapter contains sections titled: The Set Venn Diagrams Set Complementation The Null Set Subsets and Supersets Intersection Union Example of Union and Intersection Combinatorics of Venn Diagrams Numbering Regions in Venn Diagrams Combinational Logic in Venn Diagrams Set Algebraic Interpretation of Combinational Logic