Stochastic Computing with Biomolecular Automata Advanced Artificial Intelligence Cho, Sung Bum.

Slides:



Advertisements
Similar presentations
Detecting Statistical Interactions with Additive Groves of Trees
Advertisements

Modeling and Simulation By Lecturer: Nada Ahmed. Introduction to simulation and Modeling.
Lesson 10: Linear Regression and Correlation
Knowledge Based Synthesis of Control for Distributed Systems Doron Peled.
Existing “autonomous” system Sakamoto & Hagiya State transitions by molecules A transition table:{S  S’} Starting from the initial state, calculate as.
Copyright © 2006 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 1 ~ Curve Fitting ~ Least Squares Regression Chapter.
Molecular Computing Machine Uses its Input as Fuel Kobi Benenson Joint work with Rivka Adar, Tamar Paz-Elizur, Zvi Livneh and Ehud Shapiro Department of.
CHAPTER 21 Inferential Statistical Analysis. Understanding probability The idea of probability is central to inferential statistics. It means the chance.
CmpE 104 SOFTWARE STATISTICAL TOOLS & METHODS MEASURING & ESTIMATING SOFTWARE SIZE AND RESOURCE & SCHEDULE ESTIMATING.
Prediction, Correlation, and Lack of Fit in Regression (§11. 4, 11
Modeling and simulation of systems Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Simple Linear Regression and Correlation
Decision Making: An Introduction 1. 2 Decision Making Decision Making is a process of choosing among two or more alternative courses of action for the.
1 DNA Computing: Concept and Design Ruoya Wang April 21, 2008 MATH 8803 Final presentation.
This presentation can be downloaded at Water Cycle Projections over Decades to Centuries at River Basin to Regional Scales:
HMM-BASED PATTERN DETECTION. Outline  Markov Process  Hidden Markov Models Elements Basic Problems Evaluation Optimization Training Implementation 2-D.
Finite Automata Finite-state machine with no output. FA consists of States, Transitions between states FA is a 5-tuple Example! A string x is recognized.
Simple Linear Regression
Software Quality Control Methods. Introduction Quality control methods have received a world wide surge of interest within the past couple of decades.
Job Release-Time Design in Stochastic Manufacturing Systems Using Perturbation Analysis By: Dongping Song Supervisors: Dr. C.Hicks & Dr. C.F.Earl Department.
Chapter 13 Introduction to Linear Regression and Correlation Analysis
Efficient Estimation of Emission Probabilities in profile HMM By Virpi Ahola et al Reviewed By Alok Datar.
1 Simple Linear Regression Chapter Introduction In this chapter we examine the relationship among interval variables via a mathematical equation.
Planning operation start times for the manufacture of capital products with uncertain processing times and resource constraints D.P. Song, Dr. C.Hicks.
Inferences About Process Quality
Chapter 14 Introduction to Linear Regression and Correlation Analysis
Correlation and Regression Analysis
Simple Linear Regression. Introduction In Chapters 17 to 19, we examine the relationship between interval variables via a mathematical equation. The motivation.
Linear Regression/Correlation
1 Doing Statistics for Business Doing Statistics for Business Data, Inference, and Decision Making Marilyn K. Pelosi Theresa M. Sandifer Chapter 11 Regression.
Lecture 7: Simulations.
Autonomous DNA Nanomechanical Device Capable of Universal Computation and Universal Translational Motion Peng Yin*, Andrew J. Turberfield †, Sudheer Sahu*,
1 Institute of Engineering Mechanics Leopold-Franzens University Innsbruck, Austria, EU H.J. Pradlwarter and G.I. Schuëller Confidence.
12a - 1 © 2000 Prentice-Hall, Inc. Statistics Multiple Regression and Model Building Chapter 12 part I.
Introduction to Linear Regression
Chap 12-1 A Course In Business Statistics, 4th © 2006 Prentice-Hall, Inc. A Course In Business Statistics 4 th Edition Chapter 12 Introduction to Linear.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Chapter 2 Looking at Data - Relationships. Relations Among Variables Response variable - Outcome measurement (or characteristic) of a study. Also called:
Binary Stochastic Fields: Theory and Application to Modeling of Two-Phase Random Media Steve Koutsourelakis University of Innsbruck George Deodatis Columbia.
Basic Numerical Procedures Chapter 19 1 Options, Futures, and Other Derivatives, 7th Edition, Copyright © John C. Hull 2008.
TODAY we will Review what we have learned so far about Regression Develop the ability to use Residual Analysis to assess if a model (LSRL) is appropriate.
An Asymptotic Analysis of Generative, Discriminative, and Pseudolikelihood Estimators by Percy Liang and Michael Jordan (ICML 2008 ) Presented by Lihan.
Evaluating generalised calibration / Fay-Herriot model in CAPEX Tracy Jones, Angharad Walters, Ria Sanderson and Salah Merad (Office for National Statistics)
RDPStatistical Methods in Scientific Research - Lecture 41 Lecture 4 Sample size determination 4.1 Criteria for sample size determination 4.2 Finding the.
Chapter 11 Correlation and Simple Linear Regression Statistics for Business (Econ) 1.
Stochastic Computing with Biomolecular Automata R. Adar, Y. Benenson, G. Linshiz, A. Rosner, N. Tishby, and E. Shapiro PNAS, vol. 101, no. 27, pp ,
© 2015 McGraw-Hill Education. All rights reserved. Chapter 19 Markov Decision Processes.
Kanpur Genetic Algorithms Laboratory IIT Kanpur 25, July 2006 (11:00 AM) Multi-Objective Dynamic Optimization using Evolutionary Algorithms by Udaya Bhaskara.
© 2005 Prentice Hall, Decision Support Systems and Intelligent Systems, 7th Edition, Turban, Aronson, and Liang 4-1 Chapter 4 Modeling and Analysis Turban,
Axiomatic Theory of Probabilistic Decision Making under Risk Pavlo R. Blavatskyy University of Zurich April 21st, 2007.
Dependency Networks for Collaborative Filtering and Data Visualization UAI-2000 발표 : 황규백.
Economics 173 Business Statistics Lecture 10 Fall, 2001 Professor J. Petry
Section 1.6 Fitting Linear Functions to Data. Consider the set of points {(3,1), (4,3), (6,6), (8,12)} Plot these points on a graph –This is called a.
Stats Term Test 4 Solutions. c) d) An alternative solution is to use the probability mass function and.
1 1 Chapter 6 Forecasting n Quantitative Approaches to Forecasting n The Components of a Time Series n Measures of Forecast Accuracy n Using Smoothing.
HMP Simulation - Introduction Deterministic vs. Stochastic Models Risk Analysis Random Variables Best Case/Worst Case Analysis What-If Analysis.
Computacion Inteligente Least-Square Methods for System Identification.
Introduction Dispersion 1 Central Tendency alone does not explain the observations fully as it does reveal the degree of spread or variability of individual.
11-1 Copyright © 2014, 2011, and 2008 Pearson Education, Inc.
Introduction. We want to see if there is any relationship between the results on exams and the amount of hours used for studies. Person ABCDEFGHIJ Hours/
STA302/1001 week 11 Regression Models - Introduction In regression models, two types of variables that are studied:  A dependent variable, Y, also called.
Chapter 13 Simple Linear Regression
The simple linear regression model and parameter estimation
Statistical Quality Control, 7th Edition by Douglas C. Montgomery.
Corentin Briat, Ankit Gupta, Mustafa Khammash  Cell Systems 
ENM 310 Design of Experiments and Regression Analysis Chapter 3
Statistical Thinking and Applications
DESIGN OF EXPERIMENTS by R. C. Baker
Introduction to Regression
Presentation transcript:

Stochastic Computing with Biomolecular Automata Advanced Artificial Intelligence Cho, Sung Bum

Contents IntroductionIntroduction Material & MethodsMaterial & Methods Results & DiscussionResults & Discussion

Introduction Why stochastic computing ? Deterministic Vs Stochastic finite automata Deterministic finite automata through biomolecular computation Goal of this article

Stochastic Computing choice between several alternative computation paths, each with a prescribed probabilityThe core recurring step of stochastic computation -> choice between several alternative computation paths, each with a prescribed probability Useful in the analysis of biological informationUseful in the analysis of biological information → realized stochastic choice in a costly and indirect wayDigital computers → realized stochastic choice in a costly and indirect way

Deterministic Vs Stochastic finite automata Deterministic finite automata Stochastic finite automata

Biomolecular DFA Benenson et al. 2001, 2003 Hardware – restriction enzyme ( FokI ) Software – input, software, output sequences

Goal of This Study Designing principle for stochastic computer with unique properties of biomolecular computer by the relative molar concentration of the software moleculeTo realize the intended probability of each transition by the relative molar concentration of the software molecule encoding that transition

Material & Methods Assembly of ComponentsAssembly of Components Calibration ReactionCalibration Reaction Computation ReactionComputation Reaction Calculation of Transition ProbabilitiesCalculation of Transition Probabilities Determining the Deviation of Predicted ResultsDetermining the Deviation of Predicted Results

Assembly of the Components Software & Input molecule ; single stranded synthetic oligonucleotides Label molecule carboxyfluorescein at 3’ end CY5 at 5’ end

Calibration Reaction To determine the relationship between concentration of transition molecule and probabilities of transition Sequences for calibration ; aaab, bbba

Calibration Reaction O.1 uM of four symbol inputs O.5 uM of tested transition molecule (1.5 for deterministic & 0.5 for stochastic) 2.0 uM of FokI enzyme Detection of terminal state ; TYPHOON SCANNER CONTROL & IMAGEQUANT V 5.2 software

Computation Reaction Input, software and hardware molecule 0.1 : 2 :2 → 0.1 : 2 :2 Each pair of competing transition molecules → maintained at 0.5 uM Software and hardware molecule → preincubated with FokI enzyme Scanning CY 5 labeled band ( 16 ~ 17 nt long)

Calculation of Transition Probabilities By using measured output distributionBy using measured output distribution Equation set for each given program, with transition possibilities as unknown variables. A solution is an optimal set of transition probabilities minimizing the discrepancy between the calculated and the measured final state distribution 450 times of optimizationProgram 1,2,3 for training set => 450 times of optimization additional 449 optimizations with random initial values & additional 449 optimizations with random initial values among the calculated transitional probabilities, the most consistent triplet-of-transition probability set was selected →among the calculated transitional probabilities, the most consistent triplet-of-transition probability set was selected

Determining the Deviation of Predicted Results by simulating all possible independent pipetting errors of 5 % with the same possibilitiesDetermination of the standard deviation of the predicted output ratio → by simulating all possible independent pipetting errors of 5 % with the same possibilities Discrete deviations of –5%, 0%, and 5% form the nominal volume of each software molecule solution close to the predicted value with no deviation6,561 (3 8 ) different combination → the average of the set was very close to the predicted value with no deviation

Results & Discussion -1 The main idea of this studyThe main idea of this study ; the probability to obtain a particular final state can be measured directly from the relative concentration of the output molecule encoding this state ; the probability to obtain a particular final state can be measured directly from the relative concentration of the output molecule encoding this state The key problemThe key problem ; determine the function linking relative concentrations of competing transition molecules to the probability of a chosen transition ; determine the function linking relative concentrations of competing transition molecules to the probability of a chosen transition

Results of Calibration Reaction -1 higher reaction rate than T3 & T7:reason for convexityT4 & T8 software molecule → higher reaction rate than T3 & T7:reason for convexity cleave one nt further than expectedThe mistake of FokI →cleave one nt further than expected : S1 to S0, S0 to dead-end

Results of Calibration Reaction -2 Experiment for verifying that the system is in-sensitive to the concentration of input moleculeExperiment for verifying that the system is in-sensitive to the concentration of input molecule The computation is insensitive to the different input molecule concentrationThe computation is insensitive to the different input molecule concentration

Results of Calibration Reaction -3 Experiment for ensuring that the transition probability is not affected by absolute molecular concentration insensitive to concentration of transition moleculeTransition probability → insensitive to concentration of transition molecule

Results of Computation Reaction-1 Four programs with the same structure & different transition probabilities on nine inputs

Results of Computation Reaction-2 Good correlation was observed between predicted and measured results by using measured transition probabilitiesGood correlation was observed between predicted and measured results by using measured transition probabilities

A number of measured results fell outside of the expected error range and were consistently lower than the prediction some error in the method of direct probability measurementNot solely pitteting error, but rather to some error in the method of direct probability measurement between the SD of predicted output probability and the difference between measured and predicted output probabilitiesA strong correlation exist between the SD of predicted output probability and the difference between measured and predicted output probabilities Results of Computation Reaction-3

Conclusion A good fit between predicted and measured computation output using calculated probabilitiesA good fit between predicted and measured computation output using calculated probabilities The transition probability associated with a given relative concentration of a software molecule is a dependable programming toolThe transition probability associated with a given relative concentration of a software molecule is a dependable programming tool