a field, in which little has been done, but in which an enormous amount can be done in principle
|
|
- Emery Andrew Mason
- 8 years ago
- Views:
Transcription
1 1
2 2 There's Plenty of Room at the Bottom Richard P. Feynman, 1959 a field, in which little has been done, but in which an enormous amount can be done in principle Nanoworld (1 m = 10 9 nm) Nanofabrication Nanocomputation Nanorobotics Nanoelectronics Nanodiagnostics/ therapeutics
3 3 There's Plenty of Room at the Bottom Nanoworld (1 m = 10 9 nm)?
4 4 There's Plenty of Room at the Bottom Nanoworld (1 m = 10 9 nm) How to build things? How to make things move (and do work)? How to compute?
5 5 DNA 101: DNA Not merely secret to life Information encoding: bases: A, T, C, G Complementarity of bases: A T; C G Complementary single strands 3.4 nm Duplex Self-Assembly! 2 nm
6 6 DNA 101: Self-assembly Single strand DNA as Smart glues (Excerpted from Seeman 03)
7 7 DNA Based Self-Assembly & Nano-Device: Theory & Practice DNA Based How to build? Self-Assembly How to move? Nano-Device How to compute? Theory & Practice Theoretical Design Mathematical Analysis Computer Modeling Biochem.. Lab Fabrication
8 8 Roadmap: DNA Based Self-Assembly & Nano-Device Complexity of Self-Assembly Error Resilient Self-Assembly Nanorobotics Device Nanocomputing Device
9 9 Roadmap: DNA Based Self-Assembly & Nano-Device Complexity of Self-Assembly Error Resilient Self-Assembly Nanorobotics Device Nanocomputing Device
10 Self-Assembly Complexity - Error Correction Nanorobotics - Nanocomputing 10
11 11 Accretive Graph Assembly System Seed vertex Temperature Graph Weight function Temperature: τ = 2 Sequentially constructible? Seed vertex
12 12 Problems, Results, & Contributions Problems Accretive Graph Assembly Problem Self-Destructible Graph Assembly Prob. Results AGAP is NP-complete Planar AGAP is NP-complete #AGAP/Stochastic AGAP is #P-complete DGAP is PSPACE-complete Contributions Cooperative effects of attraction and repulsion General setting of graphs Dynamic self-destructible behavior in DGAP model
13 Complexity - Error Correction Nanorobotics Nanocomputing 13 Roadmap: DNA Based Self-Assembly & Nano-Device Complexity of Self-Assembly Error Resilient Self-Assembly Nanorobotics Device Nanocomputing Device
14 Self-Assembly Complexity - Error Correction Nanorobotics Nanocomputing 14
15 Complexity - Error Correction Nanorobotics Nanocomputing 15 Computational Tilings Tile (Excerpted from Yan et al 03) Computational tiles (Winfree) Pad Output 2 Output 1 Input 2 Input 1 Output 1 = Input 1 XOR Input 2 Output 2 = Input 1 AND Input 2
16 Binary counter Complexity - Error Correction Nanorobotics Nanocomputing 16 Binary counter Computational tiles Seed tile Frame tiles
17 Complexity - Error Correction Nanorobotics Nanocomputing Error in Assembly 17 Binary counter Computational tiles Seed tile Error! Frame tiles
18 Complexity - Error Correction Nanorobotics Nanocomputing 18 Error Resilient Tilings by Winfree Original tiles: Error resilient tiles: (Excerpted from Winfree 03) Error rate 2 Assembly size increased by 4
19 Complexity - Error Correction Nanorobotics Nanocomputing Compact Error Resilient Computational Tiles 19 Original tiles: X Y Z Error resilient tiles: XY YZ
20 Complexity - Error Correction Nanorobotics Nanocomputing Compact Error Resilient Computational Tiles 20 Original tiles: X Y Z Error resilient tiles: XY YZ
21 Complexity - Error Correction Nanorobotics Nanocomputing Compact Error Resilient Computational Tiles 21 Original tiles: X Y Z Error resilient tiles: XY YZ Error checking pads Assembly size not increased Two way overlay: error rate (5%) 2 (0.25%) Three way overlay: error rate (5%) 3 (0.0125%)
22 Complexity - Error Correction Nanorobotics Nanocomputing Computer Simulation (Xgrow, Winfree) 22 Three way overlay Winfree 3x3 construction Winfree 2x2 construction Two way overlay No error correction
23 23 Roadmap: DNA Based Self-Assembly & Nano-Device Complexity of Self-Assembly Error Resilient Self-Assembly Nanorobotics Device Nanocomputing Device
24 Nano-Device Complexity - Error Correction Nanorobotics - Nanocomputing 24 (R. Cross Lab)
25 Autonomous Unidirectional DNA Walker: Design 25 Restriction enzymes Ligase PflM I Walker A * Anchorage B C D A BstAP I Track
26 DNA 101: Enzyme Ligation, Restriction 26 Sticky ends DNA ligase DNA restriction enzyme
27 DNA Walker: Operation 27 Valid hybridization: A* + B = A + B* A*B B* + C = B + C* B*C C* + D = C + D* C*D D* + A = D + A* D*A Valid cut: A*B A + B* B*C B + C* C*D C + D* D*A D + A* Walker A * Anchorage B C D A Track
28 DNA Walker: Operation 28 Valid hybridization: A* + B = A + B* A*B B* + C = B + C* B*C C* + D = C + D* C*D D* + A = D + A* D*A Valid cut: A*B A + B* B*C B + C* C*D C + D* D*A D + A* Ligase A*B C D A
29 DNA Walker: Operation 29 Valid hybridization: A* + B = A + B* A*B B* + C = B + C* B*C C* + D = C + D* C*D D* + A = D + A* D*A Valid cut: A*B A + B* B*C B + C* C*D C + D* D*A D + A* Ligase A*B C D A
30 DNA Walker: Operation 30 Valid hybridization: A* + B = A + B* A*B B* + C = B + C* B*C C* + D = C + D* C*D D* + A = D + A* D*A Valid cut: A*B A + B* B*C B + C* C*D C + D* D*A D + A* PflM I A*B C D A
31 31 DNA Walker: Operation Valid hybridization: A* + B = A + B* A*B B* + C = B + C* B*C C* + D = C + D* C*D D* + A = D + A* D*A Valid cut: A*B A + B* B*C B + C* C*D C + D* D*A D + A* B* A C D A
32 DNA Walker: Operation 32 Valid hybridization: A* + B = A + B* A*B B* + C = B + C* B*C C* + D = C + D* C*D D* + A = D + A* D*A Valid cut: A*B A + B* B*C B + C* C*D C + D* D*A D + A* Ligase A B*C D A
33 DNA Walker: Operation 33 Valid hybridization: A* + B = A + B* A*B B* + C = B + C* B*C C* + D = C + D* C*D D* + A = D + A* D*A Valid cut: A*B A + B* B*C B + C* C*D C + D* D*A D + A* Ligase A B*C D A
34 DNA Walker: Operation 34 Valid hybridization: A* + B = A + B* A*B B* + C = B + C* B*C C* + D = C + D* C*D D* + A = D + A* D*A Valid cut: A*B A + B* B*C B + C* C*D C + D* D*A D + A* BstAP I A B*C D A
35 35 DNA Walker: Operation Valid hybridization: A* + B = A + B* A*B B* + C = B + C* B*C C* + D = C + D* C*D D* + A = D + A* D*A Valid cut: A*B A + B* B*C B + C* C*D C + D* D*A D + A* C* A B D A
36 DNA Walker: Operation 36 Valid hybridization: A* + B = A + B* A*B B* + C = B + C* B*C C* + D = C + D* C*D D* + A = D + A* D*A Valid cut: A*B A + B* B*C B + C* C*D C + D* D*A D + A* A B C*D A
37 37 DNA Walker: Operation Valid hybridization: A* + B = A + B* A*B B* + C = B + C* B*C C* + D = C + D* C*D D* + A = D + A* D*A Valid cut: A*B A + B* B*C B + C* C*D C + D* D*A D + A* A B C A D*
38 DNA Walker: Operation 38 Valid hybridization: A* + B = A + B* A*B B* + C = B + C* B*C C* + D = C + D* C*D D* + A = D + A* D*A Valid cut: A*B A + B* B*C B + C* C*D C + D* D*A D + A* A B C D*A
39 DNA Walker: Operation 39 Valid hybridization: A* + B = A + B* A*B B* + C = B + C* B*C C* + D = C + D* C*D D* + A = D + A* D*A Valid cut: A*B A + B* B*C B + C* C*D C + D* D*A D + A* A B C D A*
40 DNA Walker: Experimental Design 40
41 Autonomous Motion of the Walker 41
42 42 Roadmap: DNA Based Self-Assembly & Nano-Device Complexity of Self-Assembly Error Resilient Self-Assembly Nanorobotics Device Nanocomputing Device
43 Nano-Device Complexity - Error Correction Nanorobotics - Nanocomputing 43
44 DNA Cellular Computing Devices 44 Self-assembly Nanorobotics Nanocomputation (Yan et al 03) (Benenson et al 03) Complex motion Intelligent robotics devices Reusable DNA computers
45 DNA Cellular Computing Devices 45 Finite state automata Turing machine Cellular automata
46 Comp 101: Turing Machine 46 Read/write head Tape Transition rule
47 DNA Turing Machine: Structure 47 Turing machine Transition table: Rule molecules Turing head: Head molecules Data tape: Symbol molecules Autonomous universal DNA Turing machine: 2 states, 5 colors
48 Turing Machine: Operation 48 Turing machine
49 Turing Machine: Operation 49
50 Turing Machine: Operation 50
51 Turing Machine: Operation 51
52 Turing Machine: Operation 52
53 Turing Machine: Operation 53
54 Turing Machine: Operation 54
55 Turing Machine: Molecule Set 55
56 Turing Machine: Molecule Set/Simulation Digit Binary Counter
57 Summary & Future 57 Summary: Complexity & Fault-Tolerance Robotics & Computing Future: Mathematical Theory: General theory & Dynamic behavior Fault-Tolerance: Inspirations from fault tolerance theory & Biological systems Robotics Devices: Robotics lattice & Nanoparticle carrying/(un)loading Computing Devices: In silicon in vitro in vivo: Doctor in a cell Software Tools: Molecular compiler - Rational design & Simulation
58 Summary & Summary: Complexity - Error Correction Nanorobotics - Nanocomputing Future Complexity & Fault-Tolerance Robotics & Computing? Mathematical Theory: General theory & Dynamic behavior Fault-Tolerance: Fault tolerant theory & Biological inspiration Robotics Devices: Robotics lattice & Nanoparticle carrying/(un)loading Computing Devices: Intelligent robotics lattice & Doctor in a cell Software Tools: Molecular compiler - Rational design & Simulation Future: There's Plenty of Room at the Bottom!
Molecular Computing. david.wishart@ualberta.ca 3-41 Athabasca Hall Sept. 30, 2013
Molecular Computing david.wishart@ualberta.ca 3-41 Athabasca Hall Sept. 30, 2013 What Was The World s First Computer? The World s First Computer? ENIAC - 1946 Antikythera Mechanism - 80 BP Babbage Analytical
More informationNanocomputer & Architecture
Nanocomputer & Architecture Yingjie Wei Western Michigan University Department of Computer Science CS 603 - Dr. Elise dedonckor Febrary 4 th, 2004 Nanocomputer Architecture Contents Overview of Nanotechnology
More informationNano Architectures for Carbon Nanotube Circuits: Design, Analysis, and Experimental Attempts Extended Abstract
Nano Architectures for Carbon Nanotube Circuits: Design, Analysis, and Experimental Attempts Extended Abstract Eugen Czeizler, Tuomo Lempiäinen, Pekka Orponen Department of Information and Computer Science,
More informationNondeterministic polynomial time factoring in the tile assembly model
Theoretical Computer Science 395 2008) 3 23 www.elsevier.com/locate/tcs Nondeterministic polynomial time factoring in the tile assembly model Yuriy Brun Department of Computer Science, University of Southern
More informationNano-IT in medicine & its consequences Transforming Life from the inside
Nano-IT in medicine & its consequences Transforming Life from the inside Dr. M. Naci Akkøk Chief Architect, Oracle Nordic April 2015 2014 Oracle and/or its affiliates. All rights reserved. Copyright 2015
More informationDoctor of Philosophy in Computer Science
Doctor of Philosophy in Computer Science Background/Rationale The program aims to develop computer scientists who are armed with methods, tools and techniques from both theoretical and systems aspects
More informationSolving NP-complete problems in the tile assembly model
Theoretical Computer Science 395 (2008) 31 46 www.elsevier.com/locate/tcs Solving NP-complete problems in the tile assembly model Yuriy Brun Department of Computer Science, University of Southern California,
More informationUniversality in the theory of algorithms and computer science
Universality in the theory of algorithms and computer science Alexander Shen Computational models The notion of computable function was introduced in 1930ies. Simplifying (a rather interesting and puzzling)
More informationAn Open Architecture through Nanocomputing
2009 International Symposium on Computing, Communication, and Control (ISCCC 2009) Proc.of CSIT vol.1 (2011) (2011) IACSIT Press, Singapore An Open Architecture through Nanocomputing Joby Joseph1and A.
More informationHonors Class (Foundations of) Informatics. Tom Verhoeff. Department of Mathematics & Computer Science Software Engineering & Technology
Honors Class (Foundations of) Informatics Tom Verhoeff Department of Mathematics & Computer Science Software Engineering & Technology www.win.tue.nl/~wstomv/edu/hci c 2011, T. Verhoeff @ TUE.NL 1/20 Information
More informationT Cellular Silicon. 1s and 0s
T Cellular Silicon oday it is hard to imagine a world without implanted computers to monitor our health and diagnose our illnesses. But a little over 25 years ago, the face of medicine was drastically
More informationwhat operations can it perform? how does it perform them? on what kind of data? where are instructions and data stored?
Inside the CPU how does the CPU work? what operations can it perform? how does it perform them? on what kind of data? where are instructions and data stored? some short, boring programs to illustrate the
More informationTheoretical Computer Science
Theoretical Computer Science 410 (2009) 1461 1472 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Path finding in the tile assembly
More informationReplication Study Guide
Replication Study Guide This study guide is a written version of the material you have seen presented in the replication unit. Self-reproduction is a function of life that human-engineered systems have
More informationDNA Scissors: Introduction to Restriction Enzymes
DNA Scissors: Introduction to Restriction Enzymes Objectives At the end of this activity, students should be able to 1. Describe a typical restriction site as a 4- or 6-base- pair palindrome; 2. Describe
More informationTeaching a Cross-Disciplinary Nanocomputing Systems Course
Teaching a Cross-Disciplinary Nanocomputing Systems Course Waleed K. Al-Assadi 1 and Aurangzeb Khan 2 Abstract- The end of photolithography as the driver for Moore s Law is predicted within few years and
More informationDNA Computing and Its Application on NP- Completeness Problem
DNA Computing and Its Application on NP- Completeness Problem Rofilde Hasudungan 1, Rohani Abu Bakar 2, Rozlina Mohamed 3 123 Faculty Computer System and Software Engineering, Universiti Malaysia Pahang,
More informationNanotechnology and Its Impact on Modern Computer
Global Journal of Researches in Engineering General Engineering Volume 12 Issue 4 Version 1.0 Year 2012 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA)
More informationTuring Machines, Part I
Turing Machines, Part I Languages The $64,000 Question What is a language? What is a class of languages? Computer Science Theory 2 1 Now our picture looks like Context Free Languages Deterministic Context
More information1. Molecular computation uses molecules to represent information and molecular processes to implement information processing.
Chapter IV Molecular Computation These lecture notes are exclusively for the use of students in Prof. MacLennan s Unconventional Computation course. c 2013, B. J. MacLennan, EECS, University of Tennessee,
More informationCAs and Turing Machines. The Basis for Universal Computation
CAs and Turing Machines The Basis for Universal Computation What We Mean By Universal When we claim universal computation we mean that the CA is capable of calculating anything that could possibly be calculated*.
More informationM.Sc. in Nano Technology with specialisation in Nano Biotechnology
M.Sc. in Nano Technology with specialisation in Nano Biotechnology Nanotechnology is all about designing, fabricating and controlling materials, components and machinery with dimensions on the nanoscale,
More information24 Uses of Turing Machines
Formal Language and Automata Theory: CS2004 24 Uses of Turing Machines 24 Introduction We have previously covered the application of Turing Machine as a recognizer and decider In this lecture we will discuss
More informationCS257 Introduction to Nanocomputing
CS257 Introduction to Nanocomputing Overview of Crossbar-Based Computing John E Savage Overview Intro to NW growth methods Chemical vapor deposition and fluidic assembly Nano imprinting Nano stamping Four
More informationThe Nano Revolution and Its Effects on Micro/Nano Systems Education
The Nano Revolution and Its Effects on Micro/Nano Systems Education Peter M. Kogge McCourtney Prof. of CS & Engr, Assoc. Dean for Research, University of Notre Dame IBM Fellow (ret) Michael T. Niemier
More informationComputer Science. Master of Science
Computer Science Master of Science The Master of Science in Computer Science program at UALR reflects current trends in the computer science discipline and provides students with a solid theoretical and
More informationHybrid DNA and Enzymatic based Computation for Address Encoding, Link Switching and Error Correction in Molecular Communication
Hybrid DNA and Enzymatic based Computation for Address Encoding, Link Switching and Error Correction in Molecular Communication Frank Walsh 2, Sasitharan Balasubramaniam 1, Dmitri Botvich 1, Tatsuya Suda
More informationPROGRAMMING LANGUAGES
BILAL A. SHAW Communication Sciences Institute Department of Electrical Engineering 3740 McClintock Avenue, EEB-514 bilalshaw@gmail.com http://www-scf.usc.edu/~bilalsha EDUCATION Doctor of Philosophy in
More informationClass One: Degree Sequences
Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of
More information1. Nondeterministically guess a solution (called a certificate) 2. Check whether the solution solves the problem (called verification)
Some N P problems Computer scientists have studied many N P problems, that is, problems that can be solved nondeterministically in polynomial time. Traditionally complexity question are studied as languages:
More informationCoupling Engineering Sciences and Life Sciences: An overview of LAAS Activities with a special focus on Nano-Oncology Projects
Christophe Vieu Toulouse University Chargé de Mission du LAAS Axe Interaction avec le vivant Coupling Engineering Sciences and Life Sciences: An overview of LAAS Activities with a special focus on Nano-Oncology
More informationBIOLOGICAL COMPUTER MODEL TO SOLVE NP COMPLETE PROBLEM
International Journal of Information Technology and Knowledge Management January-June 2011, Volume 4, No. 1, pp. 191-194 BIOLOGICAL COMPUTER MODEL TO SOLVE NP COMPLETE PROBLEM Shalini Rajawat 1, Vijay
More informationPositions Available in SINAPSE INSTITUTE in Singapore
Positions Available in SINAPSE INSTITUTE in Singapore The SINAPSE Institute (www.sinapseinstitute.org), under the direction of Prof. Nitish Thakor (www.jhu.edu/nthakor), is a newly launched research institute
More informationCore Curriculum to the Course:
Core Curriculum to the Course: Environmental Science Law Economy for Engineering Accounting for Engineering Production System Planning and Analysis Electric Circuits Logic Circuits Methods for Electric
More informationRobotic assembly. Assembly cost per product. Manual assembly. Automatic assembly using special purpose machines. Annual Production Volume
and Manufacturing Sophisticated products involves a large individual components and subassemblies. number of 70 to 80 percent of the cost of manufacturing a product is determined during the design phase
More informationRecombinant DNA & Genetic Engineering. Tools for Genetic Manipulation
Recombinant DNA & Genetic Engineering g Genetic Manipulation: Tools Kathleen Hill Associate Professor Department of Biology The University of Western Ontario Tools for Genetic Manipulation DNA, RNA, cdna
More informationDNA Hypernetworks for Information Storage and Retrieval
DNA Hypernetworks for Information Storage and Retrieval Byoung-Tak Zhang and Joo-Kyung Kim Biointelligence Laboratory, School of Computer Science and Engineering Seoul National University, Seoul 5-7, Korea
More informationLAB TOPIC 4: ENZYMES. Enzyme catalyzed reactions can be expressed in the following way:
LAB TOPIC 4: ENZYMES Objectives Define enzyme and describe the activity of enzymes in cells. Discuss the effects of varying enzyme concentrations on the rate of enzyme activity. Discuss the effects of
More information6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008
MIT OpenCourseWare http://ocw.mit.edu 6.080 / 6.089 Great Ideas in Theoretical Computer Science Spring 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationTranslation Study Guide
Translation Study Guide This study guide is a written version of the material you have seen presented in the replication unit. In translation, the cell uses the genetic information contained in mrna to
More informationHow To Get A Computer Engineering Degree
COMPUTER ENGINEERING GRADUTE PROGRAM FOR MASTER S DEGREE (With Thesis) PREPARATORY PROGRAM* COME 27 Advanced Object Oriented Programming 5 COME 21 Data Structures and Algorithms COME 22 COME 1 COME 1 COME
More informationDepth and Excluded Courses
Depth and Excluded Courses Depth Courses for Communication, Control, and Signal Processing EECE 5576 Wireless Communication Systems 4 SH EECE 5580 Classical Control Systems 4 SH EECE 5610 Digital Control
More informationUF EDGE brings the classroom to you with online, worldwide course delivery!
What is the University of Florida EDGE Program? EDGE enables engineering professional, military members, and students worldwide to participate in courses, certificates, and degree programs from the UF
More information1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.
File: chap04, Chapter 04 1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1. 2. True or False? A gate is a device that accepts a single input signal and produces one
More informationNano Technology for Computer Science: Scope and Opportunities
International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 3 (2014), pp. 213-218 International Research Publication House http://www.irphouse.com Nano Technology for
More informationChapter 1. Computation theory
Chapter 1. Computation theory In this chapter we will describe computation logic for the machines. This topic is a wide interdisciplinary field, so that the students can work in an interdisciplinary context.
More informationCELLULAR AUTOMATA AND APPLICATIONS. 1. Introduction. This paper is a study of cellular automata as computational programs
CELLULAR AUTOMATA AND APPLICATIONS GAVIN ANDREWS 1. Introduction This paper is a study of cellular automata as computational programs and their remarkable ability to create complex behavior from simple
More informationProtein-responsive ribozyme switches in eukaryotic cells
Protein-responsive ribozyme switches in eukaryotic cells Andrew B. Kennedy, James V. Vowles, Leo d Espaux, and Christina D. Smolke Presented by Marianne Linz and Jennifer Thornton March 11, 2015 Synthetic
More informationInternational Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS) www.iasir.net
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Emerging Technologies in Computational
More informationDigital Electronics Detailed Outline
Digital Electronics Detailed Outline Unit 1: Fundamentals of Analog and Digital Electronics (32 Total Days) Lesson 1.1: Foundations and the Board Game Counter (9 days) 1. Safety is an important concept
More informationRemarks on the computational complexity of small universal Turing machines
Remarks on the computational complexity of small universal Turing machines Damien Woods School of Mathematics Boole Centre for Research in Informatics, University College Cork, Ireland http://www.bcri.ucc.ie/
More information2110711 THEORY of COMPUTATION
2110711 THEORY of COMPUTATION ATHASIT SURARERKS ELITE Athasit Surarerks ELITE Engineering Laboratory in Theoretical Enumerable System Computer Engineering, Faculty of Engineering Chulalongkorn University
More informationProperties of Stabilizing Computations
Theory and Applications of Mathematics & Computer Science 5 (1) (2015) 71 93 Properties of Stabilizing Computations Mark Burgin a a University of California, Los Angeles 405 Hilgard Ave. Los Angeles, CA
More informationComplexity Classes P and NP
Complexity Classes P and NP MATH 3220 Supplemental Presentation by John Aleshunas The cure for boredom is curiosity. There is no cure for curiosity Dorothy Parker Computational Complexity Theory In computer
More informationEmbedded Software development Process and Tools: Lesson-4 Linking and Locating Software
Embedded Software development Process and Tools: Lesson-4 Linking and Locating Software 1 1. Linker 2 Linker Links the compiled codes of application software, object codes from library and OS kernel functions.
More informationUser Manual. Laboratory of Natural Information Processing DA-IICT Gandhinagar 3DNA
Laboratory of Natural Information Processing DA-IICT Gandhinagar 3DNA User Manual 1 3DNA User Manual 2014 Manish K Gupta, Laboratory of Natural Information Processing DA-IICT, Gandhinagar, Gujarat 382007
More informationIntroduction to computer science
Introduction to computer science Michael A. Nielsen University of Queensland Goals: 1. Introduce the notion of the computational complexity of a problem, and define the major computational complexity classes.
More informationMOLECULAr PROGRAMMINg. Luca Cardelli Microsoft Research Lab Tutorial 2010-02
MOLECULAr PROGRAMMINg Luca Cardelli Microsoft Research Lab Tutorial 2010-02 02-11 Smaller and Smaller Dec. 23, 1947. John Bardeen and Walter Brattain show the first working transistor. September 1958.
More informationQuantum Computing. Robert Sizemore
Quantum Computing Robert Sizemore Outline Introduction: What is quantum computing? What use is quantum computing? Overview of Quantum Systems Dirac notation & wave functions Two level systems Classical
More informationBachelor of Games and Virtual Worlds (Programming) Subject and Course Summaries
First Semester Development 1A On completion of this subject students will be able to apply basic programming and problem solving skills in a 3 rd generation object-oriented programming language (such as
More informationAutomata Theory. Şubat 2006 Tuğrul Yılmaz Ankara Üniversitesi
Automata Theory Automata theory is the study of abstract computing devices. A. M. Turing studied an abstract machine that had all the capabilities of today s computers. Turing s goal was to describe the
More informationPushdown Automata. place the input head on the leftmost input symbol. while symbol read = b and pile contains discs advance head remove disc from pile
Pushdown Automata In the last section we found that restricting the computational power of computing devices produced solvable decision problems for the class of sets accepted by finite automata. But along
More informationInternational Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS) www.iasir.net
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Emerging Technologies in Computational
More informationHow To Compare A Markov Algorithm To A Turing Machine
Markov Algorithm CHEN Yuanmi December 18, 2007 1 Abstract Markov Algorithm can be understood as a priority string rewriting system. In this short paper we give the definition of Markov algorithm and also
More informationComputational complexity theory
Computational complexity theory Goal: A general theory of the resources needed to solve computational problems What types of resources? Time What types of computational problems? decision problem Decision
More informationAppendix 2 Molecular Biology Core Curriculum. Websites and Other Resources
Appendix 2 Molecular Biology Core Curriculum Websites and Other Resources Chapter 1 - The Molecular Basis of Cancer 1. Inside Cancer http://www.insidecancer.org/ From the Dolan DNA Learning Center Cold
More informationRegular Languages and Finite Automata
Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a
More informationAn Overview of the Evolutionary Trends in Molecular Computing using DNA
An Overview of the Evolutionary Trends in Molecular Computing using DNA Abhinav Maurya Veermata Jijabai Technological Institute, India. abhinav.maurya@yahoo.com Anu Nair Veermata Jijabai Technological
More informationLaboratory 5: Properties of Enzymes
Laboratory 5: Properties of Enzymes Technical Objectives 1. Accurately measure and transfer solutions with pipettes 2. Use a Spectrophotometer to study enzyme action. 3. Properly graph a set of data. Knowledge
More informationCOMPUTER SCIENCE 2014-2015 GRADUATE INFORMATION PACKET UNM SCHOOL OF ENGINEERING
University of New Mexico Department of Computer Science MSC01 1130 Albuquerque, NM 87131 UNM SCHOOL OF ENGINEERING COMPUTER SCIENCE 2014-2015 GRADUATE INFORMATION PACKET INTRODUCTION What is Computer Science?
More informationOn Designing DNA Databases for the Storage and Retrieval of Digital Signals
On Designing DNA Databases for the Storage and Retrieval of Digital Signals Sotirios A. Tsaftaris and Aggelos K. Katsaggelos Department of Electrical and Computer Engineering, Northwestern University,
More informationCollege of Engineering Distance Education Graduate Degree Programs, Degree Requirements and Course Offerings
College of Engineering Distance Education Graduate Degree Programs, Degree Requirements and Course Offerings Master of Engineering Program Requirements: The student must complete a total of 30 credit hours
More informationBiology AP Edition - Campbell & Reece (8th Edition)
AP biology syllabus ~ 2016-2017 Instructor s Information Course: Advance Placement Biology (A/B) Instructor: Mrs. R. R. Wingerden Phone: (805) 937-2051 x2121 E-mail: rwingerden@righetti.us Website: http://www.rwingerden.com/apbio/
More informationPhD in Computer Science at North Carolina A&T State University
PhD in Computer Science at North Carolina A&T State University December 5, 2013 Contents Admission...1 Program Requirements...2 Course Work...2 Advisory Committee...2 Residency and Other Requirements...2
More informationChallenging Questions for the Rationals of Non-Classical Programming Languages
Challenging Questions for the Rationals of Non-Classical Programming Languages Olivier Michel 1, Jean-Pierre Banâtre 2, Pascal Fradet 3 and Jean-Louis Giavitto 1 1 LaMI CNRS Université d Évry Genopole,
More information31 DNA Computing: A Research Snapshot
31 DNA Computing: A Research Snapshot Lila Kari University of Western Ontario Kalpana Mahalingam Indian Institute of Technology 31.1 Introduction... 31-1 31.2 MolecularBiologyBasics... 31-2 31.3 Adleman
More informationWhat s Up at CISE. Jeannette M. Wing
What s Up at CISE Assistant Director Computer and Information Science and Engineering Directorate and President s Professor of Computer Science Carnegie Mellon University BMSA 2 November 2007 Outline Looking
More informationTheory of Computation Chapter 2: Turing Machines
Theory of Computation Chapter 2: Turing Machines Guan-Shieng Huang Feb. 24, 2003 Feb. 19, 2006 0-0 Turing Machine δ K 0111000a 01bb 1 Definition of TMs A Turing Machine is a quadruple M = (K, Σ, δ, s),
More informationComputer Architecture Syllabus of Qualifying Examination
Computer Architecture Syllabus of Qualifying Examination PhD in Engineering with a focus in Computer Science Reference course: CS 5200 Computer Architecture, College of EAS, UCCS Created by Prof. Xiaobo
More informationInternational Language Character Code
, pp.161-166 http://dx.doi.org/10.14257/astl.2015.81.33 International Language Character Code with DNA Molecules Wei Wang, Zhengxu Zhao, Qian Xu School of Information Science and Technology, Shijiazhuang
More informationSimulation Software: Practical guidelines for approaching the selection process
Practical guidelines for approaching the selection process Randall R. Gibson, Principal / Vice President Craig Dickson, Senior Analyst TranSystems I Automation Associates, Inc. Challenge Selecting from
More informationNanotechnology, Biological Engineering and the Future of Biosensors
1 Nanotechnology, Biological Engineering and the Future of Biosensors Lesson Overview: Nanotechnologies allow the digital world and the biological world to merge and can therefore detect biological substances.
More informationMaster of Science in Computer Science
Master of Science in Computer Science Background/Rationale The MSCS program aims to provide both breadth and depth of knowledge in the concepts and techniques related to the theory, design, implementation,
More informationMeasuring Protein Concentration through Absorption Spectrophotometry
Measuring Protein Concentration through Absorption Spectrophotometry In this lab exercise you will learn how to homogenize a tissue to extract the protein, and then how to use a protein assay reagent to
More informationMOLECULAR DYNAMICS INVESTIGATION OF DEFORMATION RESPONSE OF THIN-FILM METALLIC NANOSTRUCTURES UNDER HEATING
NANOSYSTEMS: PHYSICS, CHEMISTRY, MATHEMATICS, 2011, 2 (2), P. 76 83 UDC 538.97 MOLECULAR DYNAMICS INVESTIGATION OF DEFORMATION RESPONSE OF THIN-FILM METALLIC NANOSTRUCTURES UNDER HEATING I. S. Konovalenko
More informationBoulder Dash is NP hard
Boulder Dash is NP hard Marzio De Biasi marziodebiasi [at] gmail [dot] com December 2011 Version 0.01:... now the difficult part: is it NP? Abstract Boulder Dash is a videogame created by Peter Liepa and
More informationDNA Assembly and Enzymatic Cutting in Solutions: A Gold Nanoparticle Based SERS Detection Strategy
Supporting Information DNA Assembly and Enzymatic Cutting in Solutions: A Gold Nanoparticle Based SERS Detection Strategy Elizabeth Crew 1, Hong Yan 1, Liqin Lin 1, Jun Yin 1, Zakiya Skeete 1, Timur Kotlyar
More informationIntroduction to Theory of Computation
Introduction to Theory of Computation Prof. (Dr.) K.R. Chowdhary Email: kr.chowdhary@iitj.ac.in Formerly at department of Computer Science and Engineering MBM Engineering College, Jodhpur Tuesday 28 th
More informationDepartment of Computer Science
Department of Computer Science Ali Sekmen, PhD 2, Chair 005, McCord Hall 615-963-5712 Faculty: K. Al Nasr, W. Chen, E. Erdemir, M. Hayes, H. Miao, T. Rogers, G. Shao, F. Yao General Statement: The Department
More informationProposed Board Action
AGENDA ITEM: VII A i Florida Polytechnic University Board of Trustees February 3, 2014 Subject: Approval of the Master Degree Programs Proposed Board Action Approve the Master Degree Program, Admission
More informationIntroduction to Machine Learning and Data Mining. Prof. Dr. Igor Trajkovski trajkovski@nyus.edu.mk
Introduction to Machine Learning and Data Mining Prof. Dr. Igor Trakovski trakovski@nyus.edu.mk Neural Networks 2 Neural Networks Analogy to biological neural systems, the most robust learning systems
More informationHCS604.03 Exercise 1 Dr. Jones Spring 2005. Recombinant DNA (Molecular Cloning) exercise:
HCS604.03 Exercise 1 Dr. Jones Spring 2005 Recombinant DNA (Molecular Cloning) exercise: The purpose of this exercise is to learn techniques used to create recombinant DNA or clone genes. You will clone
More informationPharmacology skills for drug discovery. Why is pharmacology important?
skills for drug discovery Why is pharmacology important?, the science underlying the interaction between chemicals and living systems, emerged as a distinct discipline allied to medicine in the mid-19th
More informationNanoManufacturing and NanoRobots
A Full Day Workshop: NanoManufacturing and NanoRobots June 2, 2009 Objectives 50 years ago, Feynman talked his vision of factories using nanomachines to build complex products, including additional nanomachines,
More informationProblems With Programmable self-assembly in a thousand-robot swarm
Problems With Programmable self-assembly in a thousand-robot swarm Affiliations: Department of Computer Science, COMSATS Institute of IT, Islamabad, Pakistan Author: Muaz A. Niazi* ǂ *Correspondence to:
More informationThe Function Game: Can You Guess the Secret?
The Function Game: Can You Guess the Secret? Copy the input and output numbers for each secret given by your teacher. Write your guess for what is happening to the input number to create the output number
More informationAnalyzing Complexity For NP-Complete Problem Through DNA Computing Algorithm
Global Journal of Computer Science and Technology Vol. 10 Issue 13 (Ver. 1.0 ) October 2010 P a g e 43 Analyzing Complexity For NP-Complete Problem Through DNA Computing Algorithm Shalini Rajawat 1, Dr
More informationThe Classes P and NP. mohamed@elwakil.net
Intractable Problems The Classes P and NP Mohamed M. El Wakil mohamed@elwakil.net 1 Agenda 1. What is a problem? 2. Decidable or not? 3. The P class 4. The NP Class 5. TheNP Complete class 2 What is a
More informationCOMPUTATIONAL ENGINEERING OF FINITE ELEMENT MODELLING FOR AUTOMOTIVE APPLICATION USING ABAQUS
International Journal of Advanced Research in Engineering and Technology (IJARET) Volume 7, Issue 2, March-April 2016, pp. 30 52, Article ID: IJARET_07_02_004 Available online at http://www.iaeme.com/ijaret/issues.asp?jtype=ijaret&vtype=7&itype=2
More information