Research 2014 Grace Chester, Katelyn Gutteridge, Morgan Spencer, Joel Henningsen, Sean Callen.

Slides:



Advertisements
Similar presentations
You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
Advertisements

Chapter 5: CPU Scheduling
Chapter 5: Control Structures II (Repetition)
Chapter 12 Keynesian Business Cycle Theory: Sticky Wages and Prices.
Chapter 11 Introduction to Programming in C
Combining Like Terms. Only combine terms that are exactly the same!! Whats the same mean? –If numbers have a variable, then you can combine only ones.
Credit hours: 4 Contact hours: 50 (30 Theory, 20 Lab) Prerequisite: TB143 Introduction to Personal Computers.
Credit hours: 4 Contact hours: 50 (30 Theory, 20 Lab) Prerequisite: TB143 Introduction to Personal Computers.
© 2010 Pearson Addison-Wesley. All rights reserved. Addison Wesley is an imprint of Chapter 5: Repetition and Loop Statements Problem Solving & Program.
© 2010 Pearson Addison-Wesley. All rights reserved. Addison Wesley is an imprint of Chapter 10: Recursion Problem Solving & Program Design in C Sixth Edition.
Combining Like Terms. Only combine terms that are exactly the same!! Whats the same mean? –If numbers have a variable, then you can combine only ones.
Complexity Settlement Simulation using CA model and GIS (proposal) Kampanart Piyathamrongchai University College London Centre for Advanced Spatial Analysis.
Forms to Spreadsheets A-Team Spring Brown Bags February 7, 2014 Jennifer Lowman Coordinator, Student Persistence Research University of Nevada, Reno.
Python Programming Chapter 13: Classes and Functions Saad Bani Mohammad Department of Computer Science Al al-Bayt University 1 st 2011/2012.
EE 369 POWER SYSTEM ANALYSIS
Announcements Homework 6 is due on Thursday (Oct 18)
© Glenn Rowe AC Lab 2 A simple card game (twenty- one)
Data points are spread over the space according to two of their component values Using real data sets to simulate evolution within complex environments.
1 University of Utah – School of Computing Computer Science 1021 "Thinking Like a Computer"
A synthetic noise generator M. Hueller LTPDA meeting, AEI Hannover 27/04/2007.
BIOLOGY AUGUST 2013 OPENING ASSIGNMENTS. AUGUST 7, 2013  Question goes here!
Running a model's adjoint to obtain derivatives, while more efficient and accurate than other methods, such as the finite difference method, is a computationally.
Sep 15, 2014 Lirong Xia Computational social choice The easy-to-compute axiom.
Chapter 10: The Traditional Approach to Design
Systems Analysis and Design in a Changing World, Fifth Edition
Less Than Matching Orgad Keller.
Bottoms Up Factoring. Start with the X-box 3-9 Product Sum
Copyright © 2010 Pearson Addison-Wesley. All rights reserved. Chapter 13 One-Factor Experiments: General.
CS123 | INTRODUCTION TO COMPUTER GRAPHICS Andries van Dam © 1/16 Deferred Lighting Deferred Lighting – 11/18/2014.
© Copyright 1992–2005 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. Tutorial 13 – Salary Survey Application: Introducing.
Classification Classification Examples
Liang, Introduction to Java Programming, Eighth Edition, (c) 2011 Pearson Education, Inc. All rights reserved Chapter 3 Loops.
Review What is a virtual function? What can be achieved with virtual functions? How to define a pure virtual function? What is an abstract class? Can a.
50.530: Software Engineering Sun Jun SUTD. Week 10: Invariant Generation.
16/13/2015 3:30 AM6/13/2015 3:30 AM6/13/2015 3:30 AMIntroduction to Software Development What is a computer? A computer system contains: Central Processing.
Loops and Iteration Chapter 5 Python for Informatics: Exploring Information
Position Reconstruction in Miniature Detector Using a Multilayer Perceptron By Adam Levine.
Software Life Cycle Requirements and problem analysis. –What exactly is this system supposed to do? Design –How will the system solve the problem? Coding.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
IXA 1234 : C++ PROGRAMMING CHAPTER 1. PROGRAMMING LANGUAGE Programming language is a computer program that can solve certain problem / task Keyword: Computer.
Simulation is the process of studying the behavior of a real system by using a model that replicates the behavior of the system under different scenarios.
An Introduction to Programming with C++ Sixth Edition Chapter 7 The Repetition Structure.
2Object-Oriented Program Development Using C++ 3 Basic Loop Structures Loops repeat execution of an instruction set Three repetition structures: while,
Graphical Models over Multiple Strings Markus Dreyer and Jason Eisner Dept. of Computer Science, Johns Hopkins University EMNLP 2009 Presented by Ji Zongcheng.
Evolving Motor Techniques for Artificial Life Kelley Hecker Period 7.
Investigating Patterns Cornell Notes & Additional Activities.
The Art of Programming. The process of breaking problems down into smaller, manageable parts By breaking the problem down, each part becomes more specific.
Intro to Loops 1.General Knowledge 2.Two Types of Loops 3.The WHILE loop 1.
Loops and Iteration Chapter 5 Python for Informatics: Exploring Information
CS1010: Programming Methodology
Lecture 7 – Repetition (Loop) FTMK, UTeM – Sem /2014.
Deep Belief Network Training Same greedy layer-wise approach First train lowest RBM (h 0 – h 1 ) using RBM update algorithm (note h 0 is x) Freeze weights.
Today… Python Keywords. Iteration (or “Loops”!) Winter 2016CISC101 - Prof. McLeod1.
Chapter 5 Section 2 The Theory Of Production. Production Functions Figure that shows how total output changes based on the change of a single variable.
Computer Programming 12 Lesson 6 – Loop structure By: Dan Lunney.
Winter 2016CISC101 - Prof. McLeod1 CISC101 Reminders Assignment 5 is posted. Exercise 8 is very similar to what you will be doing with assignment 5. Exam.
What is an Object? —— an experimental evaluation Presented by: Yao Pan.
Victoria Ibarra Mat:  Generally, Computer hardware is divided into four main functional areas. These are:  Input devices Input devices  Output.
Python Loops and Iteration
Think What will be the output?
While Loops in Python.
Python - Loops and Iteration
*current controlled assessment plans are unknown
LESSON 11 – WHILE LOOPS UNIT 5 – 1/10/17.
Algorithms Take a look at the worksheet. What do we already know, and what will we have to learn in this term?
What does this do? def revList(L): if len(L) < = 1: return L x = L[0] LR = revList(L[1:]) return LR + x.
Flowcharts and Pseudo Code
Dr. Fowler  CCM Patterns & Sequences Now - Next.
While Loops in Python.
GCSE Computing.
Presentation transcript:

Research 2014 Grace Chester, Katelyn Gutteridge, Morgan Spencer, Joel Henningsen, Sean Callen

 Caffeine diffusion modeling  What experimental data do we need?  Cellular absorption (when? How much?)

 Programmed evolution  Generating data sets Parameterized, “patternized”, randomized real data, totally randomized… Test our scores model on different types of data sets to see how well it works  Iteration (one experiment) and Cycle (3 experiments in which every variable is varied exactly once) Enhance the program to do more iterations/cycles How does our model work after more iterations/cycles?

 Increasing # of iterations and cycles  The program currently works for 1 cycle (3 iterations), but we want to generalize it to work for ‘m’ number of iterations to see how our model works in the long run  Progress: We are almost done figuring out the logic of extra iterations, but we still need to translate that logic into Python programming

 Programmed evolution cont.  Stopping criteria: when is our data considered to be informational enough? (60% “winner”? 30%? Etc.)  Scaling up and managing output Make the model work for more variables Graphically represent the results  Colony counts vs scores Biology experiment to test the colony count predictions

 >3 variables  Example: Want to vary Promoter = P, PCN = N, Chaperone = C, and Degradation tag = D  To do every combination of variable orders, we need a pattern to code it: PNCD – NPCD – CPND – PCND – NCPD – CNPD – DPNC… (12) – (13) – (12) – (13) – (12) – (14)(23)  Generalizing for >4 variables

 Programmed evolution cont.  Multiple starting points Vary the promoter starting with clones HH3, HLN, LH2 for example  Other applications What other things can our model be applied to?

 Finishing the scoring program  Perfecting the multiple variable algorithm  Make data to test both of the above  Caffeine diffusion (need biological input)  Find other application for scoring program, make it public access