Mohamed Ibrahim, Krishnendu Chakrabarty
Optimization of Trustworthy Biomolecular Quantitative Analysis Using Cyber-Physical Microfluidic Platforms
Mohamed Ibrahim, Krishnendu Chakrabarty
Optimization of Trustworthy Biomolecular Quantitative Analysis Using Cyber-Physical Microfluidic Platforms
- Broschiertes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
This book creates a new research field as it bridges the technical skills gap between microfluidic systems and molecular biology protocols but viewed from the perspective of an electronic/systems engineer.
Andere Kunden interessierten sich auch für
- Jinhui ZhangNetworked and Event-Triggered Control Approaches in Cyber-Physical Systems69,99 €
- Giuseppe NotarstefanoDistributed Optimization for Smart Cyber-Physical Networks111,99 €
- Chunyan WangRobust Cooperative Control of Multi-Agent Systems71,99 €
- Sean WeerakkodyResilient Control in Cyber-Physical Systems113,99 €
- Hussam K RisanStatistical Analysis for Civil Engineers247,99 €
- Aharon DavidUnsettled Topics Concerning Airworthiness Cyber-Security Regulation129,99 €
- Akinjide AkinolaIntroduction to Cyber-Security29,99 €
-
-
-
This book creates a new research field as it bridges the technical skills gap between microfluidic systems and molecular biology protocols but viewed from the perspective of an electronic/systems engineer.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Produktdetails
- Produktdetails
- Verlag: CRC Press
- Seitenzahl: 364
- Erscheinungstermin: 26. August 2024
- Englisch
- Abmessung: 234mm x 156mm x 20mm
- Gewicht: 553g
- ISBN-13: 9780367512910
- ISBN-10: 0367512912
- Artikelnr.: 71231820
- Verlag: CRC Press
- Seitenzahl: 364
- Erscheinungstermin: 26. August 2024
- Englisch
- Abmessung: 234mm x 156mm x 20mm
- Gewicht: 553g
- ISBN-13: 9780367512910
- ISBN-10: 0367512912
- Artikelnr.: 71231820
Mohamed Ibrahim was a Visiting Scholar with the Technical University of Munich, Germany, and the University of Bremen, Germany. He spent a total of three years as a Research and Development Engineer in the semiconductor industry where he worked on design-for-test and post-silicon validation methodologies for several system-on-chip (SoC) designs. His current research interests include SoC design and embedded systems, electronic design automation of LOC systems, Internet-of-Bio-Things, security and trust of bio-systems, and machine-learning applications of bio-systems. Dr. Ibrahim was a recipient of the Best Paper award at the 2017 IEEE/ACM Design, Automation, and Test in Europe Conference, the 2017 Postdoc Mobility award from the Technical University of Munich, Germany, two ACM conference travel awards from ACM-SIGBED in 2016 and ACM-SIGDA in 2017, and Duke Graduate School Fellowship in 2013. Krishnendu Chakrabarty is the William H. Younger Distinguished Professor and Department Chair of Electrical and Computer Engineering, and Professor of Computer Science, at Duke University. He is a recipient of the National Science Foundation CAREER award, the Office of Naval Research Young Investigator award, the Humboldt Research Award from the Alexander von Humboldt Foundation, Germany, the IEEE Transactions on CAD Donald O. Pederson Best Paper Award (2015), the ACM Transactions on Design Automation of Electronic Systems Best Paper Award (2017), and over a dozen best paper awards at major conferences. He is also a recipient of the IEEE Computer Society Technical Achievement Award (2015), the IEEE Circuits and Systems Society Charles A. Desoer Technical Achievement Award (2017), the Semiconductor Research Corporation Technical Excellence Award (2018), and the Distinguished Alumnus Award from the Indian Institute of Technology, Kharagpur (2014). Prof. Chakrabarty's current research projects include: testing and design-for-testability of integrated circuits and systems; digital microfluidics, biochips, and cyberphysical systems; data analytics for fault diagnosis, failure prediction, anomaly detection, and hardware security; neuromorphic computing systems.
1. Introduction. 2. Synthesis for Multiple Sample Pathways: Gene
Expression Analysis. 3. Synthesis of Protocols with Temporal Constraints: Epigenetic Analysis. 4. A Micro fluidics
Driven Cloud Service: Genomic Association Studies. 5. Synthesis of Protocols with Indexed Samples: Single
Cell Analysis. 6. Timing
Driven Synthesis with Pin Constraints: Single
Cell Screening. 7. Synthesis for Parameter
Space Exploration: Synthetic Bio
circuits. 8. Fault
Tolerant Realization of Biomolecular Assays. 9. Security Vulnerabilities of Quantitative
Analysis Frame
works. 10. Security Countermeasures of Quantitative
Analysis Frame
works. 11. Conclusion and Future Outlook. Appendix A Proof of Theorem 5.1: A Fully Connected Routing Crossbar. Appendix B Modeling a Fully Connected Routing Crossbar. Appendix C Proof of Lemma 6.1: Derivation of Control Delay Vector. Appendix D Proof of Theorem 6.1: Derivation of Control Latency. Appendix E Proof of Lemma 7.1: Properties of Aliquot
Generation Trees. Appendix F Proof of Theorem 7.1: Recursion in Aliquot
Generation Trees. Bibliography.
Expression Analysis. 3. Synthesis of Protocols with Temporal Constraints: Epigenetic Analysis. 4. A Micro fluidics
Driven Cloud Service: Genomic Association Studies. 5. Synthesis of Protocols with Indexed Samples: Single
Cell Analysis. 6. Timing
Driven Synthesis with Pin Constraints: Single
Cell Screening. 7. Synthesis for Parameter
Space Exploration: Synthetic Bio
circuits. 8. Fault
Tolerant Realization of Biomolecular Assays. 9. Security Vulnerabilities of Quantitative
Analysis Frame
works. 10. Security Countermeasures of Quantitative
Analysis Frame
works. 11. Conclusion and Future Outlook. Appendix A Proof of Theorem 5.1: A Fully Connected Routing Crossbar. Appendix B Modeling a Fully Connected Routing Crossbar. Appendix C Proof of Lemma 6.1: Derivation of Control Delay Vector. Appendix D Proof of Theorem 6.1: Derivation of Control Latency. Appendix E Proof of Lemma 7.1: Properties of Aliquot
Generation Trees. Appendix F Proof of Theorem 7.1: Recursion in Aliquot
Generation Trees. Bibliography.
1. Introduction. 2. Synthesis for Multiple Sample Pathways: Gene
Expression Analysis. 3. Synthesis of Protocols with Temporal Constraints: Epigenetic Analysis. 4. A Micro fluidics
Driven Cloud Service: Genomic Association Studies. 5. Synthesis of Protocols with Indexed Samples: Single
Cell Analysis. 6. Timing
Driven Synthesis with Pin Constraints: Single
Cell Screening. 7. Synthesis for Parameter
Space Exploration: Synthetic Bio
circuits. 8. Fault
Tolerant Realization of Biomolecular Assays. 9. Security Vulnerabilities of Quantitative
Analysis Frame
works. 10. Security Countermeasures of Quantitative
Analysis Frame
works. 11. Conclusion and Future Outlook. Appendix A Proof of Theorem 5.1: A Fully Connected Routing Crossbar. Appendix B Modeling a Fully Connected Routing Crossbar. Appendix C Proof of Lemma 6.1: Derivation of Control Delay Vector. Appendix D Proof of Theorem 6.1: Derivation of Control Latency. Appendix E Proof of Lemma 7.1: Properties of Aliquot
Generation Trees. Appendix F Proof of Theorem 7.1: Recursion in Aliquot
Generation Trees. Bibliography.
Expression Analysis. 3. Synthesis of Protocols with Temporal Constraints: Epigenetic Analysis. 4. A Micro fluidics
Driven Cloud Service: Genomic Association Studies. 5. Synthesis of Protocols with Indexed Samples: Single
Cell Analysis. 6. Timing
Driven Synthesis with Pin Constraints: Single
Cell Screening. 7. Synthesis for Parameter
Space Exploration: Synthetic Bio
circuits. 8. Fault
Tolerant Realization of Biomolecular Assays. 9. Security Vulnerabilities of Quantitative
Analysis Frame
works. 10. Security Countermeasures of Quantitative
Analysis Frame
works. 11. Conclusion and Future Outlook. Appendix A Proof of Theorem 5.1: A Fully Connected Routing Crossbar. Appendix B Modeling a Fully Connected Routing Crossbar. Appendix C Proof of Lemma 6.1: Derivation of Control Delay Vector. Appendix D Proof of Theorem 6.1: Derivation of Control Latency. Appendix E Proof of Lemma 7.1: Properties of Aliquot
Generation Trees. Appendix F Proof of Theorem 7.1: Recursion in Aliquot
Generation Trees. Bibliography.