Further improvements in the Boolean domain /:
The amount of digital systems supporting our daily life is increasing continuously. Improved technical facilities for their production have led to growing challenges for engineers and scientists working in the Boolean domain. A Boolean variable can only carry two different Boolean values: FALSE or T...
Gespeichert in:
| Weitere Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Newcastle upon Tyne, UK :
Cambridge Scholars Publishing,
2018.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | The amount of digital systems supporting our daily life is increasing continuously. Improved technical facilities for their production have led to growing challenges for engineers and scientists working in the Boolean domain. A Boolean variable can only carry two different Boolean values: FALSE or TRUE (0 or 1), and has the best interference resistance in technical systems. However, a Boolean function exponentially depends on the number of its variables. This exponential complexity is the reason for major problems in the process of design and realization of circuits. According to Moore's Law, |
| Beschreibung: | "This is the third book of a series that summarizes the best scientific results of contributions to the International Workshop on Boolean Problems (IWSBP)"--Acknowledgments |
| Beschreibung: | 1 online resource (xli, 494 pages) |
| Bibliographie: | Includes bibliographical references and indexes. |
| ISBN: | 9781527526389 1527526380 |
Internformat
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-on1083545199 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 190129s2018 enka ob 101 0 eng d | ||
| 040 | |a N$T |b eng |e rda |e pn |c N$T |d YDX |d EBLCP |d UKMGB |d UKAHL |d OCLCQ |d ELBRO |d OCLCQ |d NLW |d OCLCO |d OCLCQ |d OCLCO |d OCLCL | ||
| 015 | |a GBB928329 |2 bnb | ||
| 016 | 7 | |a 019233031 |2 Uk | |
| 020 | |a 9781527526389 |q (electronic bk.) | ||
| 020 | |a 1527526380 |q (electronic bk.) | ||
| 020 | |z 9781527503717 | ||
| 020 | |z 1527503712 | ||
| 035 | |a (OCoLC)1083545199 | ||
| 037 | |a 9781527526389 |b Cambridge Scholars Publishing | ||
| 050 | 4 | |a QA10.3 |b .F87 2018eb | |
| 072 | 7 | |a MAT |x 000000 |2 bisacsh | |
| 082 | 7 | |a 511.3/24 |2 23 | |
| 049 | |a MAIN | ||
| 245 | 0 | 0 | |a Further improvements in the Boolean domain / |c edited by Bernd Steinbach. |
| 264 | 1 | |a Newcastle upon Tyne, UK : |b Cambridge Scholars Publishing, |c 2018. | |
| 264 | 4 | |c ©2018 | |
| 300 | |a 1 online resource (xli, 494 pages) | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 500 | |a "This is the third book of a series that summarizes the best scientific results of contributions to the International Workshop on Boolean Problems (IWSBP)"--Acknowledgments | ||
| 504 | |a Includes bibliographical references and indexes. | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a Intro; Contents; List of Figures; List of Tables; Foreword; Preface; Acknowledgments; List of Abbreviations; I Extensions in Theory and Computations; 1 Models, Methods, and Techniques; 1.1. NP-Problems and Boolean Equations; 1.1.1. Classes of Hard Problems; 1.1.2. Boolean Functions and Equations; 1.1.3. Boolean Equations and Ternary Vectors; 1.1.4. NP-Complete Problems; 1.1.5. Boolean Equations -- a Unifying Instrument; 1.2. Analysis of the Number of Variables to Represent Index Generation Functions; 1.2.1. Background; 1.2.2. An Index Generation Unit; 1.2.3. Notation | |
| 505 | 8 | |a 1.2.4. Expected Number of Variables in the Minimal Distinguishing Set1.2.5. Distribution of the Expected Number of Distinguishing Columns; 1.2.6. Expected Number of Balanced Columns in Random Binary Matrices; 1.2.7. Found Results; 1.3. Computational Complexity of Error Metrics in Approximate Computing; 1.3.1. Approximate Computing; 1.3.2. Preliminaries; 1.3.3. Error Metrics; 1.3.4. Complexity of Computing Error Metrics; 1.4. Spectral Techniques -- Origins and Applications; 1.4.1. Origins and Evolution of Spectral Techniques; 1.4.2. Digital System Design; 1.4.3. Signal processing | |
| 505 | 8 | |a 1.4.4. Towards FFT1.4.5. Towards Alternative Spectral Techniques; 1.4.6. Applications of Spectral Techniques; 1.5. A Relational Approach to Finite Topologies; 1.5.1. Experimentation as Motivation; 1.5.2. Relation Algebra; 1.5.3. Modeling Sets and Finite Topologies; 1.5.4. Closures, Interiors and Boundaries; 1.5.5. Topological Relations and Random Topologies; 1.5.6. Implementation and Related Work; 1.6. A Real-World Model of Partially Defined Logic; 1.6.1. Real-World Asynchronous Feedback; 1.6.2. Related Topics; 1.6.3. Use Case: Low-Active RS-Latch | |
| 505 | 8 | |a 1.6.4. Functionally Stabilized Dual-Rail Implementation1.6.5. Results; 2. Accelerated Computations; 2.1. Bent Function Enumeration by a Circular Pipeline Implemented on an FPGA; 2.1.1. Background; 2.1.2. Properties of Bent Functions; 2.1.3. Architecture for Bent Function Discovery; 2.1.4. Circular Pipeline Architecture; 2.1.5. Circuit of the Circular Pipeline; 2.1.6. Experimental Results; 2.1.7. Analytical Results; 2.1.8. Practical Aspects; 2.2. Efficient Random Generation of Bent Functions Using a GPU Platform; 2.2.1. Discovery of Bent Functions | |
| 505 | 8 | |a 2.2.2. Bent Functions in Reed-Muller and Walsh Domains2.2.3. Random Generation of Bent Functions in the Reed-Muller Domain; 2.2.4. Implementation of Random Generation of Bent Functions on a GPU Platform; 2.2.5. Comparison of Random Generation of Bent Functions on CPU and GPU Platforms; 2.3. Multi-GPU Approximation for Silent Data Corruption of AN Codes; 2.3.1. Error Detection and Correction; 2.3.2. Computing Distance Distribution of AN Codes; 2.3.3. Results; 2.3.4. Summary; 2.4. Orthogonalization of a TVL in Disjunctive or Conjunctive Form; 2.4.1. Orthogonality | |
| 520 | |a The amount of digital systems supporting our daily life is increasing continuously. Improved technical facilities for their production have led to growing challenges for engineers and scientists working in the Boolean domain. A Boolean variable can only carry two different Boolean values: FALSE or TRUE (0 or 1), and has the best interference resistance in technical systems. However, a Boolean function exponentially depends on the number of its variables. This exponential complexity is the reason for major problems in the process of design and realization of circuits. According to Moore's Law, | ||
| 650 | 0 | |a Algebra, Boolean |v Congresses. | |
| 650 | 0 | |a Digital electronics |x Design and construction |v Congresses. | |
| 650 | 6 | |a Algèbre de Boole |v Congrès. | |
| 650 | 7 | |a MATHEMATICS |x General. |2 bisacsh | |
| 650 | 7 | |a Algebra, Boolean |2 fast | |
| 650 | 7 | |a Digital electronics |x Design and construction |2 fast | |
| 655 | 7 | |a Conference papers and proceedings |2 fast | |
| 700 | 1 | |a Steinbach, Bernd, |e editor. | |
| 758 | |i has work: |a Further improvements in the Boolean domain (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGdHQcpPCvpCWG4JgG3dBd |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |t Further improvements in the Boolean domain. |d Newcastle upon Tyne, UK : Cambridge Scholars Publishing, 2018 |z 9781527503717 |w (OCoLC)1007927810 |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=2012260 |3 Volltext |
| 938 | |a Askews and Holts Library Services |b ASKH |n AH35894040 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL5651690 | ||
| 938 | |a EBSCOhost |b EBSC |n 2012260 | ||
| 938 | |a eLibro |b ELBO |n ELB124660 | ||
| 938 | |a YBP Library Services |b YANK |n 16007711 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-on1083545199 |
|---|---|
| _version_ | 1816882483050840064 |
| adam_text | |
| any_adam_object | |
| author2 | Steinbach, Bernd |
| author2_role | edt |
| author2_variant | b s bs |
| author_facet | Steinbach, Bernd |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA10 |
| callnumber-raw | QA10.3 .F87 2018eb |
| callnumber-search | QA10.3 .F87 2018eb |
| callnumber-sort | QA 210.3 F87 42018EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Intro; Contents; List of Figures; List of Tables; Foreword; Preface; Acknowledgments; List of Abbreviations; I Extensions in Theory and Computations; 1 Models, Methods, and Techniques; 1.1. NP-Problems and Boolean Equations; 1.1.1. Classes of Hard Problems; 1.1.2. Boolean Functions and Equations; 1.1.3. Boolean Equations and Ternary Vectors; 1.1.4. NP-Complete Problems; 1.1.5. Boolean Equations -- a Unifying Instrument; 1.2. Analysis of the Number of Variables to Represent Index Generation Functions; 1.2.1. Background; 1.2.2. An Index Generation Unit; 1.2.3. Notation 1.2.4. Expected Number of Variables in the Minimal Distinguishing Set1.2.5. Distribution of the Expected Number of Distinguishing Columns; 1.2.6. Expected Number of Balanced Columns in Random Binary Matrices; 1.2.7. Found Results; 1.3. Computational Complexity of Error Metrics in Approximate Computing; 1.3.1. Approximate Computing; 1.3.2. Preliminaries; 1.3.3. Error Metrics; 1.3.4. Complexity of Computing Error Metrics; 1.4. Spectral Techniques -- Origins and Applications; 1.4.1. Origins and Evolution of Spectral Techniques; 1.4.2. Digital System Design; 1.4.3. Signal processing 1.4.4. Towards FFT1.4.5. Towards Alternative Spectral Techniques; 1.4.6. Applications of Spectral Techniques; 1.5. A Relational Approach to Finite Topologies; 1.5.1. Experimentation as Motivation; 1.5.2. Relation Algebra; 1.5.3. Modeling Sets and Finite Topologies; 1.5.4. Closures, Interiors and Boundaries; 1.5.5. Topological Relations and Random Topologies; 1.5.6. Implementation and Related Work; 1.6. A Real-World Model of Partially Defined Logic; 1.6.1. Real-World Asynchronous Feedback; 1.6.2. Related Topics; 1.6.3. Use Case: Low-Active RS-Latch 1.6.4. Functionally Stabilized Dual-Rail Implementation1.6.5. Results; 2. Accelerated Computations; 2.1. Bent Function Enumeration by a Circular Pipeline Implemented on an FPGA; 2.1.1. Background; 2.1.2. Properties of Bent Functions; 2.1.3. Architecture for Bent Function Discovery; 2.1.4. Circular Pipeline Architecture; 2.1.5. Circuit of the Circular Pipeline; 2.1.6. Experimental Results; 2.1.7. Analytical Results; 2.1.8. Practical Aspects; 2.2. Efficient Random Generation of Bent Functions Using a GPU Platform; 2.2.1. Discovery of Bent Functions 2.2.2. Bent Functions in Reed-Muller and Walsh Domains2.2.3. Random Generation of Bent Functions in the Reed-Muller Domain; 2.2.4. Implementation of Random Generation of Bent Functions on a GPU Platform; 2.2.5. Comparison of Random Generation of Bent Functions on CPU and GPU Platforms; 2.3. Multi-GPU Approximation for Silent Data Corruption of AN Codes; 2.3.1. Error Detection and Correction; 2.3.2. Computing Distance Distribution of AN Codes; 2.3.3. Results; 2.3.4. Summary; 2.4. Orthogonalization of a TVL in Disjunctive or Conjunctive Form; 2.4.1. Orthogonality |
| ctrlnum | (OCoLC)1083545199 |
| dewey-full | 511.3/24 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/24 |
| dewey-search | 511.3/24 |
| dewey-sort | 3511.3 224 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>06112cam a2200649 i 4500</leader><controlfield tag="001">ZDB-4-EBA-on1083545199</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">190129s2018 enka ob 101 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">YDX</subfield><subfield code="d">EBLCP</subfield><subfield code="d">UKMGB</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">ELBRO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">NLW</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">GBB928329</subfield><subfield code="2">bnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">019233031</subfield><subfield code="2">Uk</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781527526389</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1527526380</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781527503717</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1527503712</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1083545199</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">9781527526389</subfield><subfield code="b">Cambridge Scholars Publishing</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA10.3</subfield><subfield code="b">.F87 2018eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">000000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.3/24</subfield><subfield code="2">23</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Further improvements in the Boolean domain /</subfield><subfield code="c">edited by Bernd Steinbach.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Newcastle upon Tyne, UK :</subfield><subfield code="b">Cambridge Scholars Publishing,</subfield><subfield code="c">2018.</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2018</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xli, 494 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">"This is the third book of a series that summarizes the best scientific results of contributions to the International Workshop on Boolean Problems (IWSBP)"--Acknowledgments</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and indexes.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Intro; Contents; List of Figures; List of Tables; Foreword; Preface; Acknowledgments; List of Abbreviations; I Extensions in Theory and Computations; 1 Models, Methods, and Techniques; 1.1. NP-Problems and Boolean Equations; 1.1.1. Classes of Hard Problems; 1.1.2. Boolean Functions and Equations; 1.1.3. Boolean Equations and Ternary Vectors; 1.1.4. NP-Complete Problems; 1.1.5. Boolean Equations -- a Unifying Instrument; 1.2. Analysis of the Number of Variables to Represent Index Generation Functions; 1.2.1. Background; 1.2.2. An Index Generation Unit; 1.2.3. Notation</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">1.2.4. Expected Number of Variables in the Minimal Distinguishing Set1.2.5. Distribution of the Expected Number of Distinguishing Columns; 1.2.6. Expected Number of Balanced Columns in Random Binary Matrices; 1.2.7. Found Results; 1.3. Computational Complexity of Error Metrics in Approximate Computing; 1.3.1. Approximate Computing; 1.3.2. Preliminaries; 1.3.3. Error Metrics; 1.3.4. Complexity of Computing Error Metrics; 1.4. Spectral Techniques -- Origins and Applications; 1.4.1. Origins and Evolution of Spectral Techniques; 1.4.2. Digital System Design; 1.4.3. Signal processing</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">1.4.4. Towards FFT1.4.5. Towards Alternative Spectral Techniques; 1.4.6. Applications of Spectral Techniques; 1.5. A Relational Approach to Finite Topologies; 1.5.1. Experimentation as Motivation; 1.5.2. Relation Algebra; 1.5.3. Modeling Sets and Finite Topologies; 1.5.4. Closures, Interiors and Boundaries; 1.5.5. Topological Relations and Random Topologies; 1.5.6. Implementation and Related Work; 1.6. A Real-World Model of Partially Defined Logic; 1.6.1. Real-World Asynchronous Feedback; 1.6.2. Related Topics; 1.6.3. Use Case: Low-Active RS-Latch</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">1.6.4. Functionally Stabilized Dual-Rail Implementation1.6.5. Results; 2. Accelerated Computations; 2.1. Bent Function Enumeration by a Circular Pipeline Implemented on an FPGA; 2.1.1. Background; 2.1.2. Properties of Bent Functions; 2.1.3. Architecture for Bent Function Discovery; 2.1.4. Circular Pipeline Architecture; 2.1.5. Circuit of the Circular Pipeline; 2.1.6. Experimental Results; 2.1.7. Analytical Results; 2.1.8. Practical Aspects; 2.2. Efficient Random Generation of Bent Functions Using a GPU Platform; 2.2.1. Discovery of Bent Functions</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">2.2.2. Bent Functions in Reed-Muller and Walsh Domains2.2.3. Random Generation of Bent Functions in the Reed-Muller Domain; 2.2.4. Implementation of Random Generation of Bent Functions on a GPU Platform; 2.2.5. Comparison of Random Generation of Bent Functions on CPU and GPU Platforms; 2.3. Multi-GPU Approximation for Silent Data Corruption of AN Codes; 2.3.1. Error Detection and Correction; 2.3.2. Computing Distance Distribution of AN Codes; 2.3.3. Results; 2.3.4. Summary; 2.4. Orthogonalization of a TVL in Disjunctive or Conjunctive Form; 2.4.1. Orthogonality</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The amount of digital systems supporting our daily life is increasing continuously. Improved technical facilities for their production have led to growing challenges for engineers and scientists working in the Boolean domain. A Boolean variable can only carry two different Boolean values: FALSE or TRUE (0 or 1), and has the best interference resistance in technical systems. However, a Boolean function exponentially depends on the number of its variables. This exponential complexity is the reason for major problems in the process of design and realization of circuits. According to Moore's Law,</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Algebra, Boolean</subfield><subfield code="v">Congresses.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Digital electronics</subfield><subfield code="x">Design and construction</subfield><subfield code="v">Congresses.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Algèbre de Boole</subfield><subfield code="v">Congrès.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algebra, Boolean</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Digital electronics</subfield><subfield code="x">Design and construction</subfield><subfield code="2">fast</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Conference papers and proceedings</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Steinbach, Bernd,</subfield><subfield code="e">editor.</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Further improvements in the Boolean domain (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCGdHQcpPCvpCWG4JgG3dBd</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="t">Further improvements in the Boolean domain.</subfield><subfield code="d">Newcastle upon Tyne, UK : Cambridge Scholars Publishing, 2018</subfield><subfield code="z">9781527503717</subfield><subfield code="w">(OCoLC)1007927810</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=2012260</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH35894040</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL5651690</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">2012260</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">eLibro</subfield><subfield code="b">ELBO</subfield><subfield code="n">ELB124660</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">16007711</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| genre | Conference papers and proceedings fast |
| genre_facet | Conference papers and proceedings |
| id | ZDB-4-EBA-on1083545199 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:29:19Z |
| institution | BVB |
| isbn | 9781527526389 1527526380 |
| language | English |
| oclc_num | 1083545199 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (xli, 494 pages) |
| psigel | ZDB-4-EBA |
| publishDate | 2018 |
| publishDateSearch | 2018 |
| publishDateSort | 2018 |
| publisher | Cambridge Scholars Publishing, |
| record_format | marc |
| spelling | Further improvements in the Boolean domain / edited by Bernd Steinbach. Newcastle upon Tyne, UK : Cambridge Scholars Publishing, 2018. ©2018 1 online resource (xli, 494 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier "This is the third book of a series that summarizes the best scientific results of contributions to the International Workshop on Boolean Problems (IWSBP)"--Acknowledgments Includes bibliographical references and indexes. Print version record. Intro; Contents; List of Figures; List of Tables; Foreword; Preface; Acknowledgments; List of Abbreviations; I Extensions in Theory and Computations; 1 Models, Methods, and Techniques; 1.1. NP-Problems and Boolean Equations; 1.1.1. Classes of Hard Problems; 1.1.2. Boolean Functions and Equations; 1.1.3. Boolean Equations and Ternary Vectors; 1.1.4. NP-Complete Problems; 1.1.5. Boolean Equations -- a Unifying Instrument; 1.2. Analysis of the Number of Variables to Represent Index Generation Functions; 1.2.1. Background; 1.2.2. An Index Generation Unit; 1.2.3. Notation 1.2.4. Expected Number of Variables in the Minimal Distinguishing Set1.2.5. Distribution of the Expected Number of Distinguishing Columns; 1.2.6. Expected Number of Balanced Columns in Random Binary Matrices; 1.2.7. Found Results; 1.3. Computational Complexity of Error Metrics in Approximate Computing; 1.3.1. Approximate Computing; 1.3.2. Preliminaries; 1.3.3. Error Metrics; 1.3.4. Complexity of Computing Error Metrics; 1.4. Spectral Techniques -- Origins and Applications; 1.4.1. Origins and Evolution of Spectral Techniques; 1.4.2. Digital System Design; 1.4.3. Signal processing 1.4.4. Towards FFT1.4.5. Towards Alternative Spectral Techniques; 1.4.6. Applications of Spectral Techniques; 1.5. A Relational Approach to Finite Topologies; 1.5.1. Experimentation as Motivation; 1.5.2. Relation Algebra; 1.5.3. Modeling Sets and Finite Topologies; 1.5.4. Closures, Interiors and Boundaries; 1.5.5. Topological Relations and Random Topologies; 1.5.6. Implementation and Related Work; 1.6. A Real-World Model of Partially Defined Logic; 1.6.1. Real-World Asynchronous Feedback; 1.6.2. Related Topics; 1.6.3. Use Case: Low-Active RS-Latch 1.6.4. Functionally Stabilized Dual-Rail Implementation1.6.5. Results; 2. Accelerated Computations; 2.1. Bent Function Enumeration by a Circular Pipeline Implemented on an FPGA; 2.1.1. Background; 2.1.2. Properties of Bent Functions; 2.1.3. Architecture for Bent Function Discovery; 2.1.4. Circular Pipeline Architecture; 2.1.5. Circuit of the Circular Pipeline; 2.1.6. Experimental Results; 2.1.7. Analytical Results; 2.1.8. Practical Aspects; 2.2. Efficient Random Generation of Bent Functions Using a GPU Platform; 2.2.1. Discovery of Bent Functions 2.2.2. Bent Functions in Reed-Muller and Walsh Domains2.2.3. Random Generation of Bent Functions in the Reed-Muller Domain; 2.2.4. Implementation of Random Generation of Bent Functions on a GPU Platform; 2.2.5. Comparison of Random Generation of Bent Functions on CPU and GPU Platforms; 2.3. Multi-GPU Approximation for Silent Data Corruption of AN Codes; 2.3.1. Error Detection and Correction; 2.3.2. Computing Distance Distribution of AN Codes; 2.3.3. Results; 2.3.4. Summary; 2.4. Orthogonalization of a TVL in Disjunctive or Conjunctive Form; 2.4.1. Orthogonality The amount of digital systems supporting our daily life is increasing continuously. Improved technical facilities for their production have led to growing challenges for engineers and scientists working in the Boolean domain. A Boolean variable can only carry two different Boolean values: FALSE or TRUE (0 or 1), and has the best interference resistance in technical systems. However, a Boolean function exponentially depends on the number of its variables. This exponential complexity is the reason for major problems in the process of design and realization of circuits. According to Moore's Law, Algebra, Boolean Congresses. Digital electronics Design and construction Congresses. Algèbre de Boole Congrès. MATHEMATICS General. bisacsh Algebra, Boolean fast Digital electronics Design and construction fast Conference papers and proceedings fast Steinbach, Bernd, editor. has work: Further improvements in the Boolean domain (Text) https://id.oclc.org/worldcat/entity/E39PCGdHQcpPCvpCWG4JgG3dBd https://id.oclc.org/worldcat/ontology/hasWork Print version: Further improvements in the Boolean domain. Newcastle upon Tyne, UK : Cambridge Scholars Publishing, 2018 9781527503717 (OCoLC)1007927810 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=2012260 Volltext |
| spellingShingle | Further improvements in the Boolean domain / Intro; Contents; List of Figures; List of Tables; Foreword; Preface; Acknowledgments; List of Abbreviations; I Extensions in Theory and Computations; 1 Models, Methods, and Techniques; 1.1. NP-Problems and Boolean Equations; 1.1.1. Classes of Hard Problems; 1.1.2. Boolean Functions and Equations; 1.1.3. Boolean Equations and Ternary Vectors; 1.1.4. NP-Complete Problems; 1.1.5. Boolean Equations -- a Unifying Instrument; 1.2. Analysis of the Number of Variables to Represent Index Generation Functions; 1.2.1. Background; 1.2.2. An Index Generation Unit; 1.2.3. Notation 1.2.4. Expected Number of Variables in the Minimal Distinguishing Set1.2.5. Distribution of the Expected Number of Distinguishing Columns; 1.2.6. Expected Number of Balanced Columns in Random Binary Matrices; 1.2.7. Found Results; 1.3. Computational Complexity of Error Metrics in Approximate Computing; 1.3.1. Approximate Computing; 1.3.2. Preliminaries; 1.3.3. Error Metrics; 1.3.4. Complexity of Computing Error Metrics; 1.4. Spectral Techniques -- Origins and Applications; 1.4.1. Origins and Evolution of Spectral Techniques; 1.4.2. Digital System Design; 1.4.3. Signal processing 1.4.4. Towards FFT1.4.5. Towards Alternative Spectral Techniques; 1.4.6. Applications of Spectral Techniques; 1.5. A Relational Approach to Finite Topologies; 1.5.1. Experimentation as Motivation; 1.5.2. Relation Algebra; 1.5.3. Modeling Sets and Finite Topologies; 1.5.4. Closures, Interiors and Boundaries; 1.5.5. Topological Relations and Random Topologies; 1.5.6. Implementation and Related Work; 1.6. A Real-World Model of Partially Defined Logic; 1.6.1. Real-World Asynchronous Feedback; 1.6.2. Related Topics; 1.6.3. Use Case: Low-Active RS-Latch 1.6.4. Functionally Stabilized Dual-Rail Implementation1.6.5. Results; 2. Accelerated Computations; 2.1. Bent Function Enumeration by a Circular Pipeline Implemented on an FPGA; 2.1.1. Background; 2.1.2. Properties of Bent Functions; 2.1.3. Architecture for Bent Function Discovery; 2.1.4. Circular Pipeline Architecture; 2.1.5. Circuit of the Circular Pipeline; 2.1.6. Experimental Results; 2.1.7. Analytical Results; 2.1.8. Practical Aspects; 2.2. Efficient Random Generation of Bent Functions Using a GPU Platform; 2.2.1. Discovery of Bent Functions 2.2.2. Bent Functions in Reed-Muller and Walsh Domains2.2.3. Random Generation of Bent Functions in the Reed-Muller Domain; 2.2.4. Implementation of Random Generation of Bent Functions on a GPU Platform; 2.2.5. Comparison of Random Generation of Bent Functions on CPU and GPU Platforms; 2.3. Multi-GPU Approximation for Silent Data Corruption of AN Codes; 2.3.1. Error Detection and Correction; 2.3.2. Computing Distance Distribution of AN Codes; 2.3.3. Results; 2.3.4. Summary; 2.4. Orthogonalization of a TVL in Disjunctive or Conjunctive Form; 2.4.1. Orthogonality Algebra, Boolean Congresses. Digital electronics Design and construction Congresses. Algèbre de Boole Congrès. MATHEMATICS General. bisacsh Algebra, Boolean fast Digital electronics Design and construction fast |
| title | Further improvements in the Boolean domain / |
| title_auth | Further improvements in the Boolean domain / |
| title_exact_search | Further improvements in the Boolean domain / |
| title_full | Further improvements in the Boolean domain / edited by Bernd Steinbach. |
| title_fullStr | Further improvements in the Boolean domain / edited by Bernd Steinbach. |
| title_full_unstemmed | Further improvements in the Boolean domain / edited by Bernd Steinbach. |
| title_short | Further improvements in the Boolean domain / |
| title_sort | further improvements in the boolean domain |
| topic | Algebra, Boolean Congresses. Digital electronics Design and construction Congresses. Algèbre de Boole Congrès. MATHEMATICS General. bisacsh Algebra, Boolean fast Digital electronics Design and construction fast |
| topic_facet | Algebra, Boolean Congresses. Digital electronics Design and construction Congresses. Algèbre de Boole Congrès. MATHEMATICS General. Algebra, Boolean Digital electronics Design and construction Conference papers and proceedings |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=2012260 |
| work_keys_str_mv | AT steinbachbernd furtherimprovementsinthebooleandomain |