chapter 2
play

Chapter 2 Professor Brendan Morris, SEB 3216, - PowerPoint PPT Presentation

Oct 23, 2022 •260 likes •1.98k views

Chapter 2 Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu http://www.ee.unlv.edu/~b1morris/cpe100/ CPE100: Digital Logic Design I Section 1004: Dr. Morris Combinational Logic Design Chapter 2 <1> Chapter 2 :: Topics

  1. Boolean Theorems of Several Vars Number Theorem Name T6 B•C = C • B Commutativity T7 (B•C) • D = B • (C • D) Associativity T8 B • (C + D) = (B • C) + (B • D) Distributivity T9 B• (B+C) = B Covering T10 (B•C) + (B•C) = B Combining T11 B•C + (B•D) + (C•D) = Consensus B • C + B • D Chapter 2 <48>

  2. Boolean Theorems of Several Vars Number Theorem Name T6 B•C = C • B Commutativity T7 (B•C) • D = B • (C • D) Associativity T8 B • (C + D) = (B • C) + (B • D) Distributivity T9 B• (B+C) = B Covering T10 (B•C) + (B•C) = B Combining T11 B•C + (B•D) + (C•D) = Consensus B • C + B • D How do we prove these are true? Chapter 2 <49>

  3. How to Prove Boolean Relation • Method 1: Perfect induction • Method 2: Use other theorems and axioms to simplify the equation • Make one side of the equation look like the other Chapter 2 <50>

  4. Proof by Perfect Induction • Also called: proof by exhaustion • Check every possible input value • If two expressions produce the same value for every possible input combination, the expressions are equal Chapter 2 <51>

  5. Example: Proof by Perfect Induction Number Theorem Name T6 B•C = C • B Commutativity B C BC CB 0 0 0 1 1 0 1 1 Chapter 2 <52>

  6. Example: Proof by Perfect Induction Number Theorem Name T6 B•C = C • B Commutativity B C BC CB 0 0 0 0 0 1 0 0 1 0 0 0 1 1 1 1 Chapter 2 <53>

  7. Boolean Theorems of Several Vars Number Theorem Name T6 B•C = C • B Commutativity T7 (B•C) • D = B • (C • D) Associativity T8 B • (C + D) = (B • C) + (B • D) Distributivity T9 B• (B+C) = B Covering T10 (B•C) + (B•C) = B Combining T11 B•C + (B•D) + (C•D) = Consensus B • C + B • D Chapter 2 <54>

  8. T7: Associativity Number Theorem Name T7 (B•C) • D = B • (C • D) Associativity Chapter 2 <55>

  9. T8: Distributivity Number Theorem Name T8 B • (C + D) = (B • C) + (B • D) Distributivity Chapter 2 <56>

  10. T9: Covering Number Theorem Name T9 B• (B+C) = B Covering Chapter 2 <57>

  11. T9: Covering Number Theorem Name T9 B• (B+C) = B Covering Prove true by: • Method 1: Perfect induction • Method 2: Using other theorems and axioms Chapter 2 <58>

  12. T9: Covering Number Theorem Name T9 B• (B+C) = B Covering Method 1: Perfect Induction B C (B+C) B(B+C) 0 0 0 1 1 0 1 1 Chapter 2 <59>

  13. T9: Covering Number Theorem Name T9 B• (B+C) = B Covering Method 1: Perfect Induction B C (B+C) B(B+C) 0 0 0 0 0 1 1 0 1 0 1 1 1 1 1 1 Chapter 2 <60>

  14. T9: Covering Number Theorem Name T9 B• (B+C) = B Covering Method 2: Prove true using other axioms and theorems. Chapter 2 <61>

  15. T9: Covering Number Theorem Name T9 B• (B+C) = B Covering Method 2: Prove true using other axioms and theorems. B •(B+C) = B•B + B•C T8: Distributivity = B + B•C T3: Idempotency = B•(1 + C) T8: Distributivity = B•( 1 ) T2: Null element = B T1: Identity Chapter 2 <62>

  16. T10: Combining Number Theorem Name T10 (B•C) + (B•C) = B Combining Prove true using other axioms and theorems: Chapter 2 <63>

  17. T10: Combining Number Theorem Name T10 (B•C) + (B•C) = B Combining Prove true using other axioms and theorems: B•C + B• C = B•(C+C) T8: Distributivity = B •( 1 ) T5 ’ : Complements = B T1: Identity Chapter 2 <64>

  18. T11: Consensus Number Theorem Name T11 (B•C) + (B•D) + (C•D) = Consensus (B • C) + B • D Prove true using (1) perfect induction or (2) other axioms and theorems. Chapter 2 <65>

  19. Recap: Boolean Thms of Several Vars Number Theorem Name T6 B•C = C • B Commutativity T7 (B•C) • D = B • (C • D) Associativity T8 B • (C + D) = (B • C) + (B • D) Distributivity T9 B• (B+C) = B Covering T10 (B•C) + (B•C) = B Combining T11 B•C + (B•D) + (C•D) = Consensus B • C + B • D Chapter 2 <66>

  20. Boolean Thms of Several Vars: Duals # Theorem Dual Name T6 B•C = C • B B+C = C+B Commutativity T7 (B•C) • D = B • (C • D) (B + C) + D = B + (C + D) Associativity T8 B • (C + D) = (B • C) + (B • D) B + (C • D) = (B+C) (B+D) Distributivity T9 B • (B+C) = B B + (B•C) = B Covering T10 (B•C) + (B•C) = B (B+C) • (B+C) = B Combining T11 (B•C) + (B•D) + (C•D) = (B+C) • (B+D) • (C+D) = Consensus (B • C) + (B • D) (B+C) • (B+D) Dual: Replace: • with + 0 with 1 Chapter 2 <67>

  21. Boolean Thms of Several Vars: Duals # Theorem Dual Name T6 B•C = C • B B+C = C+B Commutativity T7 (B•C) • D = B • (C • D) (B + C) + D = B + (C + D) Associativity T8 B • (C + D) = (B • C) + (B • D) B + (C • D) = (B+C) (B+D) Distributivity T9 B • (B+C) = B B + (B•C) = B Covering T10 (B•C) + (B•C) = B (B+C) • (B+C) = B Combining T11 (B•C) + (B•D) + (C•D) = (B+C) • (B+D) • (C+D) = Consensus (B • C) + (B • D) (B+C) • (B+D) Dual: Replace: • with + 0 with 1 Warning: T8 ’ differs from traditional algebra: OR (+) distributes over AND (•) Chapter 2 <68>

  22. Boolean Thms of Several Vars: Duals # Theorem Dual Name T6 B•C = C • B B+C = C+B Commutativity T7 (B•C) • D = B • (C • D) (B + C) + D = B + (C + D) Associativity T8 B • (C + D) = (B • C) + (B • D) B + (C • D) = (B+C) (B+D) Distributivity T9 B • (B+C) = B B + (B•C) = B Covering T10 (B•C) + (B•C) = B (B+C) • (B+C) = B Combining T11 (B•C) + (B•D) + (C•D) = (B+C) • (B+D) • (C+D) = Consensus (B • C) + (B • D) (B+C) • (B+D) Axioms and theorems are useful for simplifying equations. Chapter 2 <69>

  23. Simplifying an Equation • Reducing an equation to the fewest number of implicants, where each implicant has the fewest literals Chapter 2 <70>

  24. Simplifying an Equation • Reducing an equation to the fewest number of implicants, where each implicant has the fewest literals Recall:  Implicant: product of literals ABC , AC , BC  Literal: variable or its complement A , A , B , B , C , C Chapter 2 <71>

  25. Simplifying an Equation • Reducing an equation to the fewest number of implicants, where each implicant has the fewest literals Recall:  Implicant: product of literals ABC , AC , BC  Literal: variable or its complement A , A , B , B , C , C • Also called: minimizing the equation Chapter 2 <72>

  26. Simplification methods • Distributivity (T8, T8 ’ ) B (C+D) = BC + BD B + CD = (B+ C)(B+D) • Covering (T9 ’ ) A + AP = A • Combining (T10) PA + PA = P Chapter 2 <73>

  27. Simplification methods • Distributivity (T8, T8 ’ ) B (C+D) = BC + BD B + CD = (B+ C)(B+D) • Covering (T9 ’ ) A + AP = A • Combining (T10) PA + PA = P • Expansion P = PA + PA A = A + AP • Duplication A = A + A Chapter 2 <74>

  28. Simplification methods • Distributivity (T8, T8 ’ ) B (C+D) = BC + BD B + CD = (B+ C)(B+D) • Covering (T9 ’ ) A + AP = A • Combining (T10) PA + PA = P • Expansion P = PA + PA A = A + AP • Duplication A = A + A • A combination of Combining/Covering PA + A = P + A Chapter 2 <75>

  29. Simplification methods • A combination of Combining/Covering PA + A = P + A PA + A = PA + ( A + AP) T9 ’ Covering Proof: = PA + PA + A T6 Commutativity = P(A + A) + A T8 Distributivity T5 ’ Complements = P (1) + A T1 Identity = P + A Chapter 2 <76>

  30. T11: Consensus Number Theorem Name T11 (B•C) + (B•D) + (C•D) = Consensus (B • C) + B • D Prove using other theorems and axioms: Chapter 2 <77>

  31. T11: Consensus Number Theorem Name T11 (B•C) + (B•D) + (C•D) = Consensus (B • C) + B • D Prove using other theorems and axioms: B•C + B•D + C•D T10: Combining = BC + BD + (CDB+CDB) = BC + BD + BCD+BCD T6: Commutativity = BC + BCD + BD + BCD T6: Commutativity T7: Associativity = (BC + BCD) + (BD + BCD) T9 ’ : Covering = BC + BD Chapter 2 <78>

  32. Recap: Boolean Thms of Several Vars # Theorem Dual Name T6 B•C = C • B B+C = C+B Commutativity T7 (B•C) • D = B • (C • D) (B + C) + D = B + (C + D) Associativity T8 B • (C + D) = (B • C) + (B • D) B + (C • D) = (B+C) (B+D) Distributivity T9 B • (B+C) = B B + (B•C) = B Covering T10 (B•C) + (B•C) = B (B+C) • (B+C) = B Combining T11 (B•C) + (B•D) + (C•D) = (B+C) • (B+D) • (C+D) = Consensus (B • C) + (B • D) (B+C) • (B+D) Chapter 2 <79>

  33. Simplification methods • Distributivity (T8, T8 ’ ) B (C+D) = BC + BD B + CD = (B+ C)(B+D) • Covering (T9 ’ ) A + AP = A • Combining (T10) PA + PA = P • Expansion P = PA + PA A = A + AP • Duplication A = A + A • A combination of Combining/Covering PA + A = P + A Chapter 2 <80>

  34. Simplifying Boolean Equations Example 1: Y = AB + AB Chapter 2 <81>

  35. Simplifying Boolean Equations Example 1: Y = AB + AB Y = A T10: Combining or = A ( B + B ) T8: Distributivity = A (1) T5’: Complements = A T1: Identity Chapter 2 <82>

  36. Simplification methods • Distributivity (T8, T8 ’ ) B (C+D) = BC + BD B + CD = (B+ C)(B+D) • Covering (T9 ’ ) A + AP = A • Combining (T10) PA + PA = P • Expansion P = PA + PA A = A + AP • Duplication A = A + A • A combination of Combining/Covering PA + A = P + A Chapter 2 <83>

  37. Simplifying Boolean Equations Example 2: Y = A ( AB + ABC) Chapter 2 <84>

  38. Simplifying Boolean Equations Example 2: Y = A ( AB + ABC) = A ( AB( 1 + C )) T8: Distributivity = A ( AB (1)) T2’: Null Element = A ( AB ) T1: Identity = ( AA ) B T7: Associativity = AB T3: Idempotency Chapter 2 <85>

  39. Simplification methods • Distributivity (T8, T8 ’ ) B (C+D) = BC + BD B + CD = (B+ C)(B+D) • Covering (T9 ’ ) A + AP = A • Combining (T10) PA + PA = P • Expansion P = PA + PA A = A + AP • Duplication A = A + A • A combination of Combining/Covering PA + A = P + A Chapter 2 <86>

  40. Simplifying Boolean Equations Example 3: Y = A’BC + A’ Recall: A’ = A Chapter 2 <87>

  41. Simplifying Boolean Equations Example 3: Y = A’BC + A’ Recall: A’ = A = A’ T9’ Covering: X + XY = X or = A’(BC + 1) T8: Distributivity = A’(1) T2’: Null Element = A’ T1: Identity Chapter 2 <88>

  42. Simplification methods • Distributivity (T8, T8 ’ ) B (C+D) = BC + BD B + CD = (B+ C)(B+D) • Covering (T9 ’ ) A + AP = A • Combining (T10) PA + PA = P • Expansion P = PA + PA A = A + AP • Duplication A = A + A • A combination of Combining/Covering PA + A = P + A Chapter 2 <89>

  43. Simplifying Boolean Equations Example 4: Y = AB’C + ABC + A’BC Chapter 2 <90>

  44. Simplifying Boolean Equations Example 4: Y = AB’C + ABC + A’BC = AB’C + ABC + ABC + A’BC T3’: Idempotency = (AB’C+ABC) + (ABC+A’BC) T7’: Associativity = AC + BC T10: Combining Chapter 2 <91>

  45. Simplification methods • Distributivity (T8, T8 ’ ) B (C+D) = BC + BD B + CD = (B+ C)(B+D) • Covering (T9 ’ ) A + AP = A • Combining (T10) PA + PA = P • Expansion P = PA + PA A = A + AP • Duplication A = A + A • A combination of Combining/Covering PA + A = P + A Chapter 2 <92>

  46. Simplifying Boolean Equations Example 5: Y = AB + BC +B’D’ + AC’D’ Chapter 2 <93>

  47. Simplifying Boolean Equations Example 5: Y = AB + BC +B’D’ + AC’D’ Method 1: Y = AB + BC + B’D’ + (ABC’D’ + AB’C’D’) T10: Combining = (AB + ABC’D’) + BC + (B’D’ + AB’C’D’) T6: Commutativity T7: Associativity = AB + BC + B’D’ T9: Covering Method 2: Y = AB + BC + B’D ’ + AC’D’ + AD’ T11: Consensus = AB + BC + B’D’ + AD’ T9: Covering = AB + BC + B’D’ T11: Consensus Chapter 2 <94>

  48. Simplification methods • Distributivity (T8, T8 ’ ) B (C+D) = BC + BD B + CD = (B+ C)(B+D) • Covering (T9 ’ ) A + AP = A • Combining (T10) PA + PA = P • Expansion P = PA + PA A = A + AP • Duplication A = A + A • A combination of Combining/Covering PA + A = P + A Chapter 2 <95>

  49. Simplifying Boolean Equations Example 6: Y = (A + BC)(A + DE) Apply T8’ first when possible: W+XZ = (W+X)(W+Z) Chapter 2 <96>

  50. Simplifying Boolean Equations Example 6: Y = (A + BC)(A + DE) Apply T8’ first when possible: W+XZ = (W+X)(W+Z) Make: X = BC, Z = DE and rewrite equation Y = (A+X)(A+Z) substitution (X=BC, Z=DE) = A + XZ T8’: Distributivity = A + BCDE substitution or Y = AA + ADE + ABC + BCDE T8: Distributivity = A + ADE + ABC + BCDE T3: Idempotency = A + ADE + ABC + BCDE = A + ABC + BCDE T9’: Covering = A + BCDE T9 ’: Covering Chapter 2 <97>

  51. Simplifying Boolean Equations Example 6: Y = (A + BC)(A + DE) Apply T8’ first when possible: W+XZ = (W+X)(W+Z) Make: X = BC, Z = DE and rewrite equation Y = (A+X)(A+Z) substitution (X=BC, Z=DE) = A + XZ T8’: Distributivity = A + BCDE substitution This is called multiplying out or an expression to get Y = AA + ADE + ABC + BCDE T8: Distributivity sum-of-products = A + ADE + ABC + BCDE T3: Idempotency (SOP) form. = A + ADE + ABC + BCDE = A + ABC + BCDE T9’: Covering = A + BCDE T9 ’: Covering Chapter 2 <98>

  52. Reminder Midterm 1: Thursday, Oct. 5 th • In class: 1 hour and 15 minutes • Chap 1 – 2.6 • Closed book, closed notes • No calculator • Boolean Theorems & Axioms document will be attached as last page of the exam for your convenience Chapter 2 <99>

  53. Multiplying Out: SOP Form An expression is in simplified sum-of- products (SOP) form when all products contain literals only. • SOP form: Y = AB + BC’ + DE • NOT SOP form: Y = DF + E(A’+B) • SOP form: Z = A + BC + DE’F Chapter 2 <100>

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Chapter 13 Chapter 13 1 What is this? Chapter 13 2 What is this? Chapter 13 3 What is

Chapter 13 Chapter 13 1 What is this? Chapter 13 2 What is this? Chapter 13 3 What is

Chapter 13 Chapter 13 1 What is this? Chapter 13 2 What is this? Chapter 13 3 What is this? Uncertainty Chapter 13 4 Outline Uncertainty Probability Syntax and Semantics Inference Independence and Bayes Rule

688 views • 37 slides
Major Themes of 7-12 the horror of human evil, particularly as it is concentrated in the state

Major Themes of 7-12 the horror of human evil, particularly as it is concentrated in the state

Chapter 2Nebuchadnezzars Dream Chapter 3Blazing Furnace Chapter 4Nebuchadnezzar worships God Chapter 5Belshazzar mocks God Chapter 6Lions Chapter 7Daniels Dream Questions: What will we do with

488 views • 13 slides
Topics 11/13/2006 Chapter 11, start Chapter 12 11/20/2006 Chapter 12 11/27/2006 Chapter 13

Topics 11/13/2006 Chapter 11, start Chapter 12 11/20/2006 Chapter 12 11/27/2006 Chapter 13

Date Chapter 11/6/2006 Chapter 10, start Chapter 11 Topics 11/13/2006 Chapter 11, start Chapter 12 11/20/2006 Chapter 12 11/27/2006 Chapter 13 Exception Handling 12/4/2006 Final Exam Using try and catch Blocks 12/11/2006 Project Due

197 views • 18 slides
Understanding 353 &amp; the Chapter 353 Downtown Project What is Chapter 353? Chapter 353 tax

Understanding 353 &amp; the Chapter 353 Downtown Project What is Chapter 353? Chapter 353 tax

Understanding 353 &amp; the Chapter 353 Downtown Project What is Chapter 353? Chapter 353 tax abatement is an incentive allowed by Missouri law to encourage the redevelopment of blighted areas through the abatement of real property taxes.

763 views • 22 slides
Appendix A Chapter 9 versus Chapter 1 1 at a Glance Chapter 9 Chapter 1 1 ( I n) voluntary Cannot

Appendix A Chapter 9 versus Chapter 1 1 at a Glance Chapter 9 Chapter 1 1 ( I n) voluntary Cannot

Appendix A Chapter 9 versus Chapter 1 1 at a Glance Chapter 9 Chapter 1 1 ( I n) voluntary Cannot be involuntary filing. Voluntary or Involuntary. Bankruptcy Chief Judge of the Court of Appeals for the Automatic assignment. Judge Circuit

495 views • 4 slides
THE ENHANCED ER (EER) MODEL CHAPTER 8 (6/E) CHAPTER 4 (5/E) CHAPTER 8 OUTLINE Extending

THE ENHANCED ER (EER) MODEL CHAPTER 8 (6/E) CHAPTER 4 (5/E) CHAPTER 8 OUTLINE Extending

THE ENHANCED ER (EER) MODEL CHAPTER 8 (6/E) CHAPTER 4 (5/E) CHAPTER 8 OUTLINE Extending the ER model Created to design more accurate database schemas Reflect the data properties and constraints more precisely Address more

398 views • 14 slides
Uncertainty Chapter 13 1 Chapter 13 4 What is this? Outline Uncertainty Probability

Uncertainty Chapter 13 1 Chapter 13 4 What is this? Outline Uncertainty Probability

What is this? Chapter 13 Uncertainty Chapter 13 1 Chapter 13 4 What is this? Outline Uncertainty Probability Syntax and Semantics Inference Independence and Bayes Rule Chapter 13 2 Chapter 13 5 What is this?

532 views • 7 slides
For Tuesday Read chapter 7 Homework: Chapter 4, exercise 1 Chapter 5, exercise 9

For Tuesday Read chapter 7 Homework: Chapter 4, exercise 1 Chapter 5, exercise 9

For Tuesday Read chapter 7 Homework: Chapter 4, exercise 1 Chapter 5, exercise 9 Program 1 Any questions? Discussion Assignment Local Beam Search Variant of hill-climbing where multiple states and successors are

363 views • 22 slides
Chapter: 14 14 14 14 Chapter: Chapter: Chapter: LTE radio access: LTE radio access: An

Chapter: 14 14 14 14 Chapter: Chapter: Chapter: LTE radio access: LTE radio access: An

3G Evolution 3G Evolution 3G Evolution 3G Evolution Chapter: 14 14 14 14 Chapter: Chapter: Chapter: LTE radio access: LTE radio access: An overview Deepak Dasalukunte Department of Electrical and Information Technology 29-Apr-2009 3G

262 views • 11 slides
OWASP London Chapter Meeting 23rd November 2017 London Chapter Chapter Leaders: Sam

OWASP London Chapter Meeting 23rd November 2017 London Chapter Chapter Leaders: Sam

OWASP London Chapter Meeting 23rd November 2017 London Chapter Chapter Leaders: Sam Stepanyan (@securestep9) Sherif Mansour (@kerberosmansour) Chapter Events: Chapter Meetings at least once every 2 months Hackathon

424 views • 29 slides
OWASP London Chapter Meeting 27th July 2017 London Chapter Chapter Leaders: Sam

OWASP London Chapter Meeting 27th July 2017 London Chapter Chapter Leaders: Sam

OWASP London Chapter Meeting 27th July 2017 London Chapter Chapter Leaders: Sam Stepanyan (@securestep9) Sherif Mansour (@kerberosmansour) Chapter Events: Chapter Meetings at least once every 2 months Hackathon &amp;

564 views • 32 slides
OWASP London Chapter Meeting 28th September 2017 London Chapter Chapter Leaders: Sam

OWASP London Chapter Meeting 28th September 2017 London Chapter Chapter Leaders: Sam

OWASP London Chapter Meeting 28th September 2017 London Chapter Chapter Leaders: Sam Stepanyan (@securestep9) Sherif Mansour (@kerberosmansour) Chapter Events: Chapter Meetings at least once every 2 months Hackathon

381 views • 35 slides
For Tuesday Read chapter 12, sections 1-4 Homework: Chapter 10, exercise 9 Chapter

For Tuesday Read chapter 12, sections 1-4 Homework: Chapter 10, exercise 9 Chapter

For Tuesday Read chapter 12, sections 1-4 Homework: Chapter 10, exercise 9 Chapter 13, exercise 8 Program 2 Any questions? Due Friday night Constructing the planning graph Level P 1 : all literals from the initial state

844 views • 41 slides
Efficient Capital Markets (ECM) (Welch, Chapter 12) Ivo Welch Excursion Chapter This chapter

Efficient Capital Markets (ECM) (Welch, Chapter 12) Ivo Welch Excursion Chapter This chapter

Efficient Capital Markets (ECM) (Welch, Chapter 12) Ivo Welch Excursion Chapter This chapter covers a lot of closely related phenomena, . . . but only briefly for lack of time. Making Sense All reasonable financial models impose the belief

982 views • 80 slides
Introduction 1.1 Legal background This series of lectures lecture has been prepared using the

Introduction 1.1 Legal background This series of lectures lecture has been prepared using the

AAT Tax Update 2014 Chapter 1 Introduction Chapter 2 Budget round-up - overview of key announcements - particular interest/ importance Personal tax Income tax, NICs, tax allowances etc Chapter 3 Chapter 4 Business tax review - MIP/SME

1.23k views • 74 slides
A.I.S. Class 17: Outline Learning Objectives for Chapter 10 Chapter 10 Quiz Chapter 10

A.I.S. Class 17: Outline Learning Objectives for Chapter 10 Chapter 10 Quiz Chapter 10

A.I.S. Class 17: Outline Learning Objectives for Chapter 10 Chapter 10 Quiz Chapter 10 Highlights Group Projects Group Work for Chapter 10 College Computing Dr. Peter R Gillett November 1, 2006 1 Learning Objectives for

564 views • 21 slides
Homegate BoF Chair Slides 9 November 2009 Monday, November 9, 2009 Note Well Any submission to

Homegate BoF Chair Slides 9 November 2009 Monday, November 9, 2009 Note Well Any submission to

Homegate BoF Chair Slides 9 November 2009 Monday, November 9, 2009 Note Well Any submission to the IETF intended by the Contributor for publication as all or part of an IETF Internet-Draft or RFC and any statement made within the context of an

319 views • 8 slides
SMAC and XGBoost your Theorem Prover Edvard K. Holden Konstantin Korovin The University of

SMAC and XGBoost your Theorem Prover Edvard K. Holden Konstantin Korovin The University of

SMAC and XGBoost your Theorem Prover Edvard K. Holden Konstantin Korovin The University of Manchester 1 Theorem Proving in First-Order Logic Proof Axioms + Conjecture iProver | Counter model | Timeout 2 Heuristics - The Key to Success

1.03k views • 26 slides
Finding Your Social Media Sweet Spot @fundraiserchad 97 percent of nonprofits regularly use

Finding Your Social Media Sweet Spot @fundraiserchad 97 percent of nonprofits regularly use

Finding Your Social Media Sweet Spot @fundraiserchad 97 percent of nonprofits regularly use social media to engage their supporters and donors. ( Global NGO Technology Report, 2019 ) But that doesnt mean they use it well Finding Your

1.25k views • 78 slides
The Beauty and Joy of The Beauty and Joy of Computing Computing Lectur Lecture #23 e #23

The Beauty and Joy of The Beauty and Joy of Computing Computing Lectur Lecture #23 e #23

The Beauty and Joy of The Beauty and Joy of Computing Computing Lectur Lecture #23 e #23 Limits of Computing Limits of Computing UC Berkeley EECS UC Berkeley EECS Youll have the opportunity for extra credit on your project! After you

188 views • 14 slides
CSCI-2500: Computer Organization Boolean Logic &amp; Arithmetic for Computers (Chapter 3 and

CSCI-2500: Computer Organization Boolean Logic &amp; Arithmetic for Computers (Chapter 3 and

CSCI-2500: Computer Organization Boolean Logic &amp; Arithmetic for Computers (Chapter 3 and App. B) Boolean Algebra Developed by George Boole in the 1850s Mathematical theory of logic. Shannon was the first to use Boolean Algebra

1.94k views • 183 slides
Specialization Oriented Programming Jim Newton, VCAD, Cadence Design Systems 29th July 2007 Jim

Specialization Oriented Programming Jim Newton, VCAD, Cadence Design Systems 29th July 2007 Jim

Overview Generic Specializer Examples Other specializers Meta programming Conclusion Specialization Oriented Programming Jim Newton, VCAD, Cadence Design Systems 29th July 2007 Jim Newton, Specialization Oriented Programming Overview

659 views • 42 slides
CSE326:DataStructures Lecture#16 SortingThingsOut Bart Niswonger

CSE326:DataStructures Lecture#16 SortingThingsOut Bart Niswonger

CSE326:DataStructures Lecture#16 SortingThingsOut Bart Niswonger SummerQuarter2001 UnixTutorial!! Usefultools Tuesday,July31 st grep, egrep/grep -e sort 10:50am,Sieg322 cut file tr

639 views • 18 slides
A Sorted Partitioning Approach to High- speed and Fast-update OpenFlow Classification Sorrachai

A Sorted Partitioning Approach to High- speed and Fast-update OpenFlow Classification Sorrachai

24th IEEE International Conference on Network Protocols (ICNP 2016) github.com/sorrachai/ParHtonSort A Sorted Partitioning Approach to High- speed and Fast-update OpenFlow Classification Sorrachai Yingchareonthawornchai, James Daly, Alex X.

697 views • 33 slides

More recommend