M etodos Matem aticos e de Computa c ao I

Size: px
Start display at page:

Download "M etodos Matem aticos e de Computa c ao I"

Transcription

1 Métodos Matemáticos e de Computação I

2 Complex Systems 01/16 General structure Microscopic scale Individual behavior Description of the constituents Model Macroscopic scale Collective behavior Emergence of regularities with size

3 Computer simulations 02/16 Python (2., 3. ) Installation of Anaconda

4 Computer simulations 03/16 Python Simulation of the agents Iterative processes Random numbers Complexity Randomness

5 Python 04/16 Installation - Anaconda Open a terminal Linux (Ubuntu): Ctrl + Alt + t Mac: Applications / Utilities Windows: Remark: Windows: dir Directory1\Directory2\ icon.png Linux/Mac: cd Directory1/Directory2/

6 Python 05/16 Paths for the execution of a program 1) Write / change a code 2) Save the code 3) Execute (at the terminal) python programa.py Remark: The file program.py should be at the same directory where the third command is executed

7 Python - Print command 06/16 Command: print print 'Hello, world!' Hello, world! # The symbol '#' indicates # comment, which is not an # effective part of the code

8 Python - Print command 06/16 Command: print print 'Hello, world!' Hello, world! 1+2 i print '1+2' i = 0 print 'i' # The symbol '#' indicates # comment, which is not an # effective part of the code 3 0 print 1+2 i = 0 print i

9 Coin flip 07/16 Single coin flip Commands: if and else Idea Code (Python) Generate a random number r [0.0, 1.0] If r > 0.5: Write 'Head' Otherwise: Write 'Tail'

10 Coin flip 07/16 Single coin flip Commands: if and else Idea Code (Python) import random Generate a random number r [0.0, 1.0] If r > 0.5: Write 'Head' Otherwise: Write 'Tail' r = random.uniform(0.0, 1.0) if r > 0.5: print 'Head' else: print 'Tail'

11 Coin flip 08/16 Ten coin flips Command: for import random for i in range(10): r = random.uniform(0.0, 1.0) if r > 0.5: print 'Head' else: print 'Tail'

12 Coin flip 09/16 Ten coin flips Command: while import random i = 0 # Store 0 at i while i<10: r = random.uniform(0.0, 1.0) if r > 0.5: print 'Head' else: print 'Tail' i = i+1 # Store i+1 at i

13 Two urns with N balls L balls in the left urn Initial condition R balls in the right urn Example: Dynamics (1) Choose one of the N balls randomly (2) The chosen ball is moved to the opposite urn (3) Return to (1) 10/16 L + R = N L = 7 R = 3 N = 10

14 11/16 File ehrenfest.py L: Bleft R: Bright Ttot iterations (total time) t list: List for time left list: List for L (...) for t in range (1, Ttot+1): # Time: 1 a Ttot r = random.uniform(0.0, 1.0) if r < Bleft / float(bleft + Bright): Bleft -= 1 # Same as Bleft = Bleft - 1 Bright += 1 # Same as Bright = Bright + 1 else: Bleft += 1 Bright -= 1 t list.append(t) # Attaching t to t list left list.append(bleft) # Attaching Bleft to left list (...)

15 12/16 File ehrenfest.py Initial condition: L = 10 and R = 0 Ttot = 100 Ttot = 5000

16 13/16 Ttot = 100 Ttot = 5000

17 13/16 Ttot = 100 Ttot = 5000 Extremal situations Intuition : Memory loss & concentration around L+R 2

18 14/16 Increase of number of balls & decrease of relative fluctuations

19 14/16 Increase of number of balls & decrease of relative fluctuations balls and Ttot =

20 14/16 Increase of number of balls & decrease of relative fluctuations balls and Ttot = balls and Ttot =

21 14/16 Increase of number of balls & decrease of relative fluctuations balls and Ttot = balls and Ttot =

22 15/16 File: ehrenfest multirun.py Increase of the number of runs (...) for n in range (run): # Repetitions: run for t in range (1, Ttot+1): # Time: 1 a Ttot r = random.uniform(0.0, 1.0) if r < Bleft / float(bleft + Bright): Bleft -= 1 # Same as Bleft = Bleft - 1 Bright += 1 # Same as Bright = Bright + 1 else: Bleft += 1 Bright -= 1 (...)

23 16/16 File: ehrenfest multirun.py Increase of the number of runs 1 iteration

24 16/16 File: ehrenfest multirun.py Increase of the number of runs 1 iteration 10 iterations

25 16/16 File: ehrenfest multirun.py Increase of the number of runs 1 iteration 10 iterations 1000 iterations Estimation of uncertainties

LightWork Memo 18: Galactic Spectra Data Overview 1

LightWork Memo 18: Galactic Spectra Data Overview 1 LightWork Memo 18: Galactic Spectra Data Overview 1 Subject: Galactic Spectra Data Overview Memo: 18, revision 1 From: Glen Langston, Evan Smith and Sophie Knudsen Date: 2017 August 18 Summary: Examples

More information

TensorFlow. Dan Evans

TensorFlow. Dan Evans TensorFlow Presentation references material from https://www.tensorflow.org/get_started/get_started and Data Science From Scratch by Joel Grus, 25, O Reilly, Ch. 8 Dan Evans TensorFlow www.tensorflow.org

More information

Bayes Factor Single Arm Time-to-event User s Guide (Version 1.0.0)

Bayes Factor Single Arm Time-to-event User s Guide (Version 1.0.0) Bayes Factor Single Arm Time-to-event User s Guide (Version 1.0.0) Department of Biostatistics P. O. Box 301402, Unit 1409 The University of Texas, M. D. Anderson Cancer Center Houston, Texas 77230-1402,

More information

Gluing Galaxies: A Jupyter Notebook and Glue Tutorial

Gluing Galaxies: A Jupyter Notebook and Glue Tutorial Gluing Galaxies: A Jupyter Notebook and Glue Tutorial Abstract: This tutorial will be utilizing an app called Jupyter Notebook to create and visualize scatter plots using python code. The data we want

More information

Databases through Python-Flask and MariaDB

Databases through Python-Flask and MariaDB 1 Databases through Python-Flask and MariaDB Tanmay Agarwal, Durga Keerthi and G V V Sharma Contents 1 Python-flask 1 1.1 Installation.......... 1 1.2 Testing Flask......... 1 2 Mariadb 1 2.1 Software

More information

Python Tutorial on Reading in & Manipulating Fits Images and Creating Image Masks (with brief introduction on DS9)

Python Tutorial on Reading in & Manipulating Fits Images and Creating Image Masks (with brief introduction on DS9) 1 Tyler James Metivier Professor Whitaker Undergrad. Research February 26, 2017 Python Tutorial on Reading in & Manipulating Fits Images and Creating Image Masks (with brief introduction on DS9) Abstract:

More information

ECEN 449: Microprocessor System Design Department of Electrical and Computer Engineering Texas A&M University

ECEN 449: Microprocessor System Design Department of Electrical and Computer Engineering Texas A&M University ECEN 449: Microprocessor System Design Department of Electrical and Computer Engineering Texas A&M University Prof. Sunil P. Khatri Lab exercise created and tested by: Abbas Fairouz, Ramu Endluri, He Zhou,

More information

LAST TIME..THE COMMAND LINE

LAST TIME..THE COMMAND LINE LAST TIME..THE COMMAND LINE Maybe slightly to fast.. Finder Applications Utilities Terminal The color can be adjusted and is simply a matter of taste. Per default it is black! Dr. Robert Kofler Introduction

More information

Lectures about Python, useful both for beginners and experts, can be found at (http://scipy-lectures.github.io).

Lectures about Python, useful both for beginners and experts, can be found at  (http://scipy-lectures.github.io). Random Matrix Theory (Sethna, "Entropy, Order Parameters, and Complexity", ex. 1.6, developed with Piet Brouwer) 2016, James Sethna, all rights reserved. This is an ipython notebook. This hints file is

More information

Simultaneous Equations Solve for x and y (What are the values of x and y): Summation What is the value of the following given x = j + 1. x i.

Simultaneous Equations Solve for x and y (What are the values of x and y): Summation What is the value of the following given x = j + 1. x i. 1 Algebra Simultaneous Equations Solve for x and y (What are the values of x and y): x + 2y = 6 x - y = 3 Summation What is the value of the following given x = j + 1. Summation Calculate the following:

More information

Molecular Dynamics, Stochastic simulations, and Monte Carlo

Molecular Dynamics, Stochastic simulations, and Monte Carlo UMEÅ UNIVERSITY September 11, 2018 Department of Physics Modeling and Simulation, 7.5hp Molecular Dynamics, Stochastic simulations, and Monte Carlo Peter Olsson Miscellanous comments The following instructions

More information

Using the EartH2Observe data portal to analyse drought indicators. Lesson 4: Using Python Notebook to access and process data

Using the EartH2Observe data portal to analyse drought indicators. Lesson 4: Using Python Notebook to access and process data Using the EartH2Observe data portal to analyse drought indicators Lesson 4: Using Python Notebook to access and process data Preface In this fourth lesson you will again work with the Water Cycle Integrator

More information

Dr.Salwa Alsaleh fac.ksu.edu.sa/salwams

Dr.Salwa Alsaleh fac.ksu.edu.sa/salwams Dr.Salwa Alsaleh Salwams@ksu.edu.sa fac.ksu.edu.sa/salwams Lecture 5 Basic Ideas of Statistical Mechanics General idea Macrostates and microstates Fundamental assumptions A simple illustration: tossing

More information

Lecture 8: Conditional probability I: definition, independence, the tree method, sampling, chain rule for independent events

Lecture 8: Conditional probability I: definition, independence, the tree method, sampling, chain rule for independent events Lecture 8: Conditional probability I: definition, independence, the tree method, sampling, chain rule for independent events Discrete Structures II (Summer 2018) Rutgers University Instructor: Abhishek

More information

Bayesian data analysis using JASP

Bayesian data analysis using JASP Bayesian data analysis using JASP Dani Navarro compcogscisydney.com/jasp-tute.html Part 1: Theory Philosophy of probability Introducing Bayes rule Bayesian reasoning A simple example Bayesian hypothesis

More information

Computational Problem Solving

Computational Problem Solving Computational Problem Solving 1 In computational problem solving, a representation is needed of the relevant aspects of a given problem to solve. The means of solving the problem is based on algorithms

More information

MAT Mathematics in Today's World

MAT Mathematics in Today's World MAT 1000 Mathematics in Today's World Last Time We discussed the four rules that govern probabilities: 1. Probabilities are numbers between 0 and 1 2. The probability an event does not occur is 1 minus

More information

Lab 2: Photon Counting with a Photomultiplier Tube

Lab 2: Photon Counting with a Photomultiplier Tube Lab 2: Photon Counting with a Photomultiplier Tube 1 Introduction 1.1 Goals In this lab, you will investigate properties of light using a photomultiplier tube (PMT). You will assess the quantitative measurements

More information

TDDD63 Project: API. September 13, 2014

TDDD63 Project: API. September 13, 2014 TDDD63 Project: API Martin Söderén September 13, 2014 Contents 1 Using the API 2 2 Connection and Status 2 2.1 how to connect through USB...................... 2 2.2 how to connect through wlan......................

More information

REVIEW: Waves on a String

REVIEW: Waves on a String Lecture 14: Solution to the Wave Equation (Chapter 6) and Random Walks (Chapter 7) 1 Description of Wave Motion REVIEW: Waves on a String We are all familiar with the motion of a transverse wave pulse

More information

BCMB/CHEM 8190 Lab Exercise Using Maple for NMR Data Processing and Pulse Sequence Design March 2012

BCMB/CHEM 8190 Lab Exercise Using Maple for NMR Data Processing and Pulse Sequence Design March 2012 BCMB/CHEM 8190 Lab Exercise Using Maple for NMR Data Processing and Pulse Sequence Design March 2012 Introduction Maple is a powerful collection of routines to aid in the solution of mathematical problems

More information

HOW TO USE MIKANA. 1. Decompress the zip file MATLAB.zip. This will create the directory MIKANA.

HOW TO USE MIKANA. 1. Decompress the zip file MATLAB.zip. This will create the directory MIKANA. HOW TO USE MIKANA MIKANA (Method to Infer Kinetics And Network Architecture) is a novel computational method to infer reaction mechanisms and estimate the kinetic parameters of biochemical pathways from

More information

Discrete Probability Distributions

Discrete Probability Distributions Discrete Probability Distributions Data Science: Jordan Boyd-Graber University of Maryland JANUARY 18, 2018 Data Science: Jordan Boyd-Graber UMD Discrete Probability Distributions 1 / 1 Refresher: Random

More information

Evolving a New Feature for a Working Program

Evolving a New Feature for a Working Program Evolving a New Feature for a Working Program Mike Stimpson arxiv:1104.0283v1 [cs.ne] 2 Apr 2011 January 18, 2013 Abstract A genetic programming system is created. A first fitness function f 1 is used to

More information

Carleton University. Final Examination Fall DURATION: 2 HOURS No. of students: 223

Carleton University. Final Examination Fall DURATION: 2 HOURS No. of students: 223 Carleton University Final Examination Fall 2016 DURATION: 2 HOURS No. of students: 223 Department Name & Course Number: Computer Science COMP 2804A Course Instructor: Michiel Smid Authorized memoranda:

More information

Simulation Modeling. Random Numbers

Simulation Modeling. Random Numbers Mathematical Modeling Lia Vas Simulation Modeling. Random Numbers In many cases one of the following situations might occur: - It is not possible to observe the behavior directly or to conduct experiments.

More information

11. Probability Sample Spaces and Probability

11. Probability Sample Spaces and Probability 11. Probability 11.1 Sample Spaces and Probability 1 Objectives A. Find the probability of an event. B. Find the empirical probability of an event. 2 Theoretical Probabilities 3 Example A fair coin is

More information

MATH 3510: PROBABILITY AND STATS July 1, 2011 FINAL EXAM

MATH 3510: PROBABILITY AND STATS July 1, 2011 FINAL EXAM MATH 3510: PROBABILITY AND STATS July 1, 2011 FINAL EXAM YOUR NAME: KEY: Answers in blue Show all your work. Answers out of the blue and without any supporting work may receive no credit even if they are

More information

Lab 4 Motion in One-Dimension Part 2: Position, Velocity and Acceleration Graphically and Statistically (pre-requisite Lab3)

Lab 4 Motion in One-Dimension Part 2: Position, Velocity and Acceleration Graphically and Statistically (pre-requisite Lab3) Lab 4 Motion in One-Dimension Part 2: Position, Velocity and Acceleration Graphically and Statistically (pre-requisite Lab3) Objectives: To obtain an understanding of position, velocity, and acceleration

More information

LandscapeDNDC: Getting started

LandscapeDNDC: Getting started LandscapeDNDC: Getting started ldndc-team Institute of Meteorology and Climate Research 1 2018-02-09 ldndc-team - Institute of Meteorology and Climate Research KIT University of the State of Baden-Wuerttemberg

More information

I. Numerical Computing

I. Numerical Computing I. Numerical Computing A. Lectures 1-3: Foundations of Numerical Computing Lecture 1 Intro to numerical computing Understand difference and pros/cons of analytical versus numerical solutions Lecture 2

More information

1. Rolling a six sided die and observing the number on the uppermost face is an experiment with six possible outcomes; 1, 2, 3, 4, 5 and 6.

1. Rolling a six sided die and observing the number on the uppermost face is an experiment with six possible outcomes; 1, 2, 3, 4, 5 and 6. Section 7.1: Introduction to Probability Almost everybody has used some conscious or subconscious estimate of the likelihood of an event happening at some point in their life. Such estimates are often

More information

Randomization in Algorithms

Randomization in Algorithms Randomization in Algorithms Randomization is a tool for designing good algorithms. Two kinds of algorithms Las Vegas - always correct, running time is random. Monte Carlo - may return incorrect answers,

More information

STA 4321/5325 Solution to Extra Homework 1 February 8, 2017

STA 4321/5325 Solution to Extra Homework 1 February 8, 2017 STA 431/535 Solution to Etra Homework 1 February 8, 017 1. Show that for any RV X, V (X 0. (You can assume X to be discrete, but this result holds in general. Hence or otherwise show that E(X E (X. Solution.

More information

Lecture 5b: Starting Matlab

Lecture 5b: Starting Matlab Lecture 5b: Starting Matlab James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University August 7, 2013 Outline 1 Resources 2 Starting Matlab 3 Homework

More information

Lab 6: Linear Algebra

Lab 6: Linear Algebra 6.1 Introduction Lab 6: Linear Algebra This lab is aimed at demonstrating Python s ability to solve linear algebra problems. At the end of the assignment, you should be able to write code that sets up

More information

M o n i t o r i n g O c e a n C o l o u r P y t h o n p r o c e d u r e f o r d o w n l o a d

M o n i t o r i n g O c e a n C o l o u r P y t h o n p r o c e d u r e f o r d o w n l o a d M o n i t o r i n g O c e a n C o l o u r P y t h o n p r o c e d u r e f o r d o w n l o a d Copernicus User Uptake Information Sessions Copernicus EU Copernicus EU Copernicus EU www.copernicus.eu I N

More information

lightcurve Data Processing program v1.0

lightcurve Data Processing program v1.0 lightcurve Data Processing program v1.0 Build 8/22/2012 Using Lightcurve... 1 Lightcurve Command Line Parameters... 2 Lightcurve Outputs and Files... 3 Lightcurve Examples... 3 Data File Formats... 4 Lightcurve

More information

RNA evolution and Genotype to Phenotype maps

RNA evolution and Genotype to Phenotype maps RNA evolution and Genotype to Phenotype maps E.S. Colizzi November 8, 2018 Introduction Biological evolution occurs in a population because 1) different genomes can generate different reproductive success

More information

Venn Diagrams; Probability Laws. Notes. Set Operations and Relations. Venn Diagram 2.1. Venn Diagrams; Probability Laws. Notes

Venn Diagrams; Probability Laws. Notes. Set Operations and Relations. Venn Diagram 2.1. Venn Diagrams; Probability Laws. Notes Lecture 2 s; Text: A Course in Probability by Weiss 2.4 STAT 225 Introduction to Probability Models January 8, 2014 s; Whitney Huang Purdue University 2.1 Agenda s; 1 2 2.2 Intersection: the intersection

More information

Protein Structure and Visualisation. Introduction to PDB and PyMOL

Protein Structure and Visualisation. Introduction to PDB and PyMOL Protein Structure and Visualisation Introduction to PDB and PyMOL 1 Feedback Persons http://www.bio-evaluering.dk/ 2 Program 8.00-8.15 Quiz results 8.15-8.50 Introduction to PDB & PyMOL 8.50-9.00 Break

More information

PC TOOL FOR DATA ANALYSIS IN CALIBRATION OF SPECIAL WEIGHTS

PC TOOL FOR DATA ANALYSIS IN CALIBRATION OF SPECIAL WEIGHTS XIX IMEKO World Congress Fundamental and Applied Metrology September 611, 009, Lisbon, Portugal PC TOOL FOR DATA ANALYSIS IN CALIBRATION OF SPECIAL WEIGHTS Adriana Vâlcu 1, Sterică Baicu 1 National Institute

More information

Simulink Modeling Tutorial

Simulink Modeling Tutorial Simulink Modeling Tutorial Train system Free body diagram and Newton's law Model Construction Running the Model Obtaining MATLAB Model In Simulink, it is very straightforward to represent a physical system

More information

CS Deep Reinforcement Learning HW2: Policy Gradients due September 19th 2018, 11:59 pm

CS Deep Reinforcement Learning HW2: Policy Gradients due September 19th 2018, 11:59 pm CS294-112 Deep Reinforcement Learning HW2: Policy Gradients due September 19th 2018, 11:59 pm 1 Introduction The goal of this assignment is to experiment with policy gradient and its variants, including

More information

where c m s (1)

where c m s (1) General Physics Experiment 6 Spectrum of Hydrogen s Emission Lines Objectives: < To determine wave lengths of the bright emission lines of hydrogen. < To test the relationship between wavelength and energy

More information

Total. Name: Student ID: CSE 21A. Midterm #2. February 28, 2013

Total. Name: Student ID: CSE 21A. Midterm #2. February 28, 2013 Name: Student ID: CSE 21A Midterm #2 February 28, 2013 There are 6 problems. The number of points a problem is worth is shown next to the problem. Show your work (even on multiple choice questions)! Also,

More information

L23: hidden Markov models

L23: hidden Markov models L23: hidden Markov models Discrete Markov processes Hidden Markov models Forward and Backward procedures The Viterbi algorithm This lecture is based on [Rabiner and Juang, 1993] Introduction to Speech

More information

1. Basics of Information

1. Basics of Information 1. Basics of Information 6.004x Computation Structures Part 1 Digital Circuits Copyright 2015 MIT EECS 6.004 Computation Structures L1: Basics of Information, Slide #1 What is Information? Information,

More information

CHEOPS Feasibility Checker Guidelines

CHEOPS Feasibility Checker Guidelines CHEOPS Feasibility Checker Guidelines Open a terminal and run the following commands (USERNAME as provided by the SOC - UNIGE): ssh X USERNAME@isdc-nx00.isdc.unige.ch ssh X USERNAME@tichpsmps00 /cheops_sw/mps_test/bin/mps_client

More information

Skip Lists. What is a Skip List. Skip Lists 3/19/14

Skip Lists. What is a Skip List. Skip Lists 3/19/14 Presentation for use with the textbook Data Structures and Algorithms in Java, 6 th edition, by M. T. Goodrich, R. Tamassia, and M. H. Goldwasser, Wiley, 2014 Skip Lists 15 15 23 10 15 23 36 Skip Lists

More information

Problem # Number of points 1 /20 2 /20 3 /20 4 /20 5 /20 6 /20 7 /20 8 /20 Total /150

Problem # Number of points 1 /20 2 /20 3 /20 4 /20 5 /20 6 /20 7 /20 8 /20 Total /150 Name Student ID # Instructor: SOLUTION Sergey Kirshner STAT 516 Fall 09 Practice Midterm #1 January 31, 2010 You are not allowed to use books or notes. Non-programmable non-graphic calculators are permitted.

More information

Ambiguity Aversion Without Asymmetric Information

Ambiguity Aversion Without Asymmetric Information Ambiguity Aversion Without Asymmetric Information Daniel Chen & Martin Schonger ETH Zurich - Center for Law and Economics www.nber.org/~dlchen www.n.ethz.ch/~scmartin Post_FUR, August 7, 4 Chen/Schonger

More information

ECEN 651: Microprogrammed Control of Digital Systems Department of Electrical and Computer Engineering Texas A&M University

ECEN 651: Microprogrammed Control of Digital Systems Department of Electrical and Computer Engineering Texas A&M University ECEN 651: Microprogrammed Control of Digital Systems Department of Electrical and Computer Engineering Texas A&M University Prof. Mi Lu TA: Ehsan Rohani Laboratory Exercise #4 MIPS Assembly and Simulation

More information

A First Course on Kinetics and Reaction Engineering Example 9.4

A First Course on Kinetics and Reaction Engineering Example 9.4 Example 9.4 Problem Purpose This problem illustrates the use of a Lineweaver-Burk plot to determine the values of the constants in a Michaelis-Menten rate expression. Problem Statement Suppose the enzyme-catalyzed

More information

User's Manual altimeter V1.1

User's Manual altimeter V1.1 User's Manual altimeter V1.1 The altimeter is completely autonomous. It can be installed on any model. It automatically detects the beginning of flights and does not record the period between two consecutive

More information

Stat 516, Homework 1

Stat 516, Homework 1 Stat 516, Homework 1 Due date: October 7 1. Consider an urn with n distinct balls numbered 1,..., n. We sample balls from the urn with replacement. Let N be the number of draws until we encounter a ball

More information

Recursive Estimation

Recursive Estimation Recursive Estimation Raffaello D Andrea Spring 08 Problem Set : Bayes Theorem and Bayesian Tracking Last updated: March, 08 Notes: Notation: Unless otherwise noted, x, y, and z denote random variables,

More information

Variations of the Turing Machine

Variations of the Turing Machine Variations of the Turing Machine 1 The Standard Model Infinite Tape a a b a b b c a c a Read-Write Head (Left or Right) Control Unit Deterministic 2 Variations of the Standard Model Turing machines with:

More information

Outline. policies for the second part. with answers. MCS 260 Lecture 10.5 Introduction to Computer Science Jan Verschelde, 9 July 2014

Outline. policies for the second part. with answers. MCS 260 Lecture 10.5 Introduction to Computer Science Jan Verschelde, 9 July 2014 Outline 1 midterm exam on Friday 11 July 2014 policies for the second part 2 some review questions with answers MCS 260 Lecture 10.5 Introduction to Computer Science Jan Verschelde, 9 July 2014 Intro to

More information

Homework 1. Part(a) Due: 15 Mar, 2018, 11:55pm

Homework 1. Part(a) Due: 15 Mar, 2018, 11:55pm ENGG1203: Introduction to Electrical and Electronic Engineering Second Semester, 2017 18 Homework 1 Due: 15 Mar, 2018, 11:55pm Instruction: Submit your answers electronically through Moodle. In Moodle,

More information

FEEG6017 lecture: Akaike's information criterion; model reduction. Brendan Neville

FEEG6017 lecture: Akaike's information criterion; model reduction. Brendan Neville FEEG6017 lecture: Akaike's information criterion; model reduction Brendan Neville bjn1c13@ecs.soton.ac.uk Occam's razor William of Occam, 1288-1348. All else being equal, the simplest explanation is the

More information

Dynamic Programming Part 2: Probability, Combinatorics, and Bitmasks

Dynamic Programming Part 2: Probability, Combinatorics, and Bitmasks Dynamic Programming Part 2: Probability, Combinatorics, and Bitmasks Duke Compsci 309s Siyang Chen Introduction Probability, combinatorics, and bitmasking appear commonly in dynamic programming problems.

More information

Introduction to Hartree-Fock calculations in Spartan

Introduction to Hartree-Fock calculations in Spartan EE5 in 2008 Hannes Jónsson Introduction to Hartree-Fock calculations in Spartan In this exercise, you will get to use state of the art software for carrying out calculations of wavefunctions for molecues,

More information

Sample Project: Simulation of Turing Machines by Machines with only Two Tape Symbols

Sample Project: Simulation of Turing Machines by Machines with only Two Tape Symbols Sample Project: Simulation of Turing Machines by Machines with only Two Tape Symbols The purpose of this document is to illustrate what a completed project should look like. I have chosen a problem that

More information

Python & Numpy A tutorial

Python & Numpy A tutorial Python & Numpy A tutorial Devert Alexandre School of Software Engineering of USTC 13 February 2012 Slide 1/38 Table of Contents 1 Why Python & Numpy 2 First steps with Python 3 Fun with lists 4 Quick tour

More information

RANDOMIZED ALGORITHMS

RANDOMIZED ALGORITHMS CH 9.4 : SKIP LISTS ACKNOWLEDGEMENT: THESE SLIDES ARE ADAPTED FROM SLIDES PROVIDED WITH DATA STRUCTURES AND ALGORITHMS IN C++, GOODRICH, TAMASSIA AND MOUNT (WILEY 2004) AND SLIDES FROM NANCY M. AMATO AND

More information

1 Random variables and distributions

1 Random variables and distributions Random variables and distributions In this chapter we consider real valued functions, called random variables, defined on the sample space. X : S R X The set of possible values of X is denoted by the set

More information

ELEG 3143 Probability & Stochastic Process Ch. 2 Discrete Random Variables

ELEG 3143 Probability & Stochastic Process Ch. 2 Discrete Random Variables Department of Electrical Engineering University of Arkansas ELEG 3143 Probability & Stochastic Process Ch. 2 Discrete Random Variables Dr. Jingxian Wu wuj@uark.edu OUTLINE 2 Random Variable Discrete Random

More information

ES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK

ES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK ES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK What is SIMULINK? SIMULINK is a software package for modeling, simulating, and analyzing

More information

213 Midterm coming up

213 Midterm coming up 213 Midterm coming up Monday April 8 @ 7 pm (conflict exam @ 5:15pm) Covers: Lectures 1-12 (not including thermal radiation) HW 1-4 Discussion 1-4 Labs 1-2 Review Session Sunday April 7, 3-5 PM, 141 Loomis

More information

Exercise 4 Modeling transient currents and voltages

Exercise 4 Modeling transient currents and voltages Exercise 4 Modeling transient currents and voltages Basic A circuit elements In a D circuit, the electro-motive forces push the electrons along the circuit and resistors remove that energy by conversion

More information

6. How Functions Work and Are Accessed. Topics: Modules and Functions More on Importing Call Frames

6. How Functions Work and Are Accessed. Topics: Modules and Functions More on Importing Call Frames 6. How Functions Work and Are Accessed Topics: Modules and Functions More on Importing Call Frames Let s Talk About Modules What Are They? M1.py A module is a.py file that contains Python code The name

More information

Department of Chemical Engineering University of California, Santa Barbara Spring Exercise 2. Due: Thursday, 4/19/09

Department of Chemical Engineering University of California, Santa Barbara Spring Exercise 2. Due: Thursday, 4/19/09 Department of Chemical Engineering ChE 210D University of California, Santa Barbara Spring 2012 Exercise 2 Due: Thursday, 4/19/09 Objective: To learn how to compile Fortran libraries for Python, and to

More information

QuantumWise. QuantumWise is now part of Synopsys

QuantumWise. QuantumWise is now part of Synopsys Table of Contents Table of Contents NiSi2 Si interface Create the NiSi2/Si device The screening region Increase the length of the central region Set-up the calculation for the undoped device Dope the device

More information

ENGG1015: Homework 1

ENGG1015: Homework 1 ENGG1015 Homework 1 Question 1 ENGG1015: Homework 1 Due: Nov 5, 2012, 11:55pm Instruction: Submit your answers electronically through Moodle (Link to Homework 1). You may type your answers using any text

More information

SOLUTION. Homework 1. Part(a) Due: 15 Mar, 2018, 11:55pm

SOLUTION. Homework 1. Part(a) Due: 15 Mar, 2018, 11:55pm ENGG1203: Introduction to Electrical and Electronic Engineering Second Semester, 2017 18 Homework 1 Due: 15 Mar, 2018, 11:55pm Instruction: Submit your answers electronically through Moodle. In Moodle,

More information

Axioms of Probability

Axioms of Probability Sample Space (denoted by S) The set of all possible outcomes of a random experiment is called the Sample Space of the experiment, and is denoted by S. Example 1.10 If the experiment consists of tossing

More information

Standards-Based Quantification in DTSA-II Part II

Standards-Based Quantification in DTSA-II Part II Standards-Based Quantification in DTSA-II Part II Nicholas W.M. Ritchie National Institute of Standards and Technology, Gaithersburg, MD 20899-8371 nicholas.ritchie@nist.gov Introduction This article is

More information

Skip List. CS 561, Lecture 11. Skip List. Skip List

Skip List. CS 561, Lecture 11. Skip List. Skip List Skip List CS 561, Lecture 11 Jared Saia University of New Mexico Technically, not a BST, but they implement all of the same operations Very elegant randomized data structure, simple to code but analysis

More information

Your Second Physics Simulation: A Mass on a Spring

Your Second Physics Simulation: A Mass on a Spring Your Second Physics Simulation: A Mass on a Spring I. INTRODUCTION At this point I think everybody has a working bouncing ball program. In these programs the ball moves under the influence of a very simple

More information

AMS 132: Discussion Section 2

AMS 132: Discussion Section 2 Prof. David Draper Department of Applied Mathematics and Statistics University of California, Santa Cruz AMS 132: Discussion Section 2 All computer operations in this course will be described for the Windows

More information

SYMBOLIC AND NUMERICAL COMPUTING FOR CHEMICAL KINETIC REACTION SCHEMES

SYMBOLIC AND NUMERICAL COMPUTING FOR CHEMICAL KINETIC REACTION SCHEMES SYMBOLIC AND NUMERICAL COMPUTING FOR CHEMICAL KINETIC REACTION SCHEMES by Mark H. Holmes Yuklun Au J. W. Stayman Department of Mathematical Sciences Rensselaer Polytechnic Institute, Troy, NY, 12180 Abstract

More information

Math 341: Probability Eighth Lecture (10/6/09)

Math 341: Probability Eighth Lecture (10/6/09) Math 341: Probability Eighth Lecture (10/6/09) Steven J Miller Williams College Steven.J.Miller@williams.edu http://www.williams.edu/go/math/sjmiller/ public html/341/ Bronfman Science Center Williams

More information

ECE2111 Signals and Systems UMD, Spring 2013 Experiment 1: Representation and manipulation of basic signals in MATLAB

ECE2111 Signals and Systems UMD, Spring 2013 Experiment 1: Representation and manipulation of basic signals in MATLAB ECE2111 Signals and Systems UMD, Spring 2013 Experiment 1: Representation and manipulation of basic signals in MATLAB MATLAB is a tool for doing numerical computations with matrices and vectors. It can

More information

Vector Spaces. 1 Theory. 2 Matlab. Rules and Operations

Vector Spaces. 1 Theory. 2 Matlab. Rules and Operations Vector Spaces Rules and Operations 1 Theory Recall that we can specify a point in the plane by an ordered pair of numbers or coordinates (x, y) and a point in space with an order triple of numbers (x,

More information

Simple Consumption / Savings Problems (based on Ljungqvist & Sargent, Ch 16, 17) Jonathan Heathcote. updated, March The household s problem X

Simple Consumption / Savings Problems (based on Ljungqvist & Sargent, Ch 16, 17) Jonathan Heathcote. updated, March The household s problem X Simple Consumption / Savings Problems (based on Ljungqvist & Sargent, Ch 16, 17) subject to for all t Jonathan Heathcote updated, March 2006 1. The household s problem max E β t u (c t ) t=0 c t + a t+1

More information

INF 5860 Machine learning for image classification. Lecture 5 : Introduction to TensorFlow Tollef Jahren February 14, 2018

INF 5860 Machine learning for image classification. Lecture 5 : Introduction to TensorFlow Tollef Jahren February 14, 2018 INF 5860 Machine learning for image classification Lecture 5 : Introduction to TensorFlow Tollef Jahren February 14, 2018 OUTLINE Deep learning frameworks TensorFlow TensorFlow graphs TensorFlow session

More information

Homework 9: Protein Folding & Simulated Annealing : Programming for Scientists Due: Thursday, April 14, 2016 at 11:59 PM

Homework 9: Protein Folding & Simulated Annealing : Programming for Scientists Due: Thursday, April 14, 2016 at 11:59 PM Homework 9: Protein Folding & Simulated Annealing 02-201: Programming for Scientists Due: Thursday, April 14, 2016 at 11:59 PM 1. Set up We re back to Go for this assignment. 1. Inside of your src directory,

More information

ISSP User Guide CY3207ISSP. Revision C

ISSP User Guide CY3207ISSP. Revision C CY3207ISSP ISSP User Guide Revision C Cypress Semiconductor 198 Champion Court San Jose, CA 95134-1709 Phone (USA): 800.858.1810 Phone (Intnl): 408.943.2600 http://www.cypress.com Copyrights Copyrights

More information

Lab 1a Wind Tunnel Testing Principles & Drag Coefficients of Golf balls

Lab 1a Wind Tunnel Testing Principles & Drag Coefficients of Golf balls Lab 1a Wind Tunnel Testing Principles & Drag Coefficients of Golf balls OBJECTIVES - To perform air flow measurement using the wind tunnel. - To compare measured and theoretical velocities for various

More information

Linear Motion with Constant Acceleration

Linear Motion with Constant Acceleration Linear Motion 1 Linear Motion with Constant Acceleration Overview: First you will attempt to walk backward with a constant acceleration, monitoring your motion with the ultrasonic motion detector. Then

More information

Week 4: Hopfield Network

Week 4: Hopfield Network Week 4: Hopfield Network Phong Le, Willem Zuidema November 20, 2013 Last week we studied multi-layer perceptron, a neural network in which information is only allowed to transmit in one direction (from

More information

MENA 9520 FME Modelling Tutorial 5 ( )

MENA 9520 FME Modelling Tutorial 5 ( ) MENA 9520 FME Modelling Tutorial 5 (25.02.2011) Task 5: Understanding type of bonding using charge-density plots Exercise 5.1: Visualizing charge density in Si: 1. mkdir charge 2. Copy a converged CTRL

More information

Site-specific Identification of Lysine Acetylation Stoichiometries in Mammalian Cells

Site-specific Identification of Lysine Acetylation Stoichiometries in Mammalian Cells Supplementary Information Site-specific Identification of Lysine Acetylation Stoichiometries in Mammalian Cells Tong Zhou 1, 2, Ying-hua Chung 1, 2, Jianji Chen 1, Yue Chen 1 1. Department of Biochemistry,

More information

Physics 750: Exercise 2 Tuesday, August 29, 2017

Physics 750: Exercise 2 Tuesday, August 29, 2017 Physics 750: Exercise 2 Tuesday, August 29, 207 Use the curl command to download from the class website everything you ll need for this exercise $ WEBPATH=http://wwwphyolemissedu/~kbeach/ $ curl $WEBPATH/courses/fall207/phys750/src/exercise2tgz

More information

ECEN 449: Microprocessor System Design Department of Electrical and Computer Engineering Texas A&M University

ECEN 449: Microprocessor System Design Department of Electrical and Computer Engineering Texas A&M University ECEN 449: Microprocessor System Design Department of Electrical and Computer Engineering Texas A&M University Prof. Sunil P Khatri (Lab exercise created and tested by Ramu Endluri, He Zhou and Sunil P

More information

EBIS-PIC 2D. 2D EBIS Simulation Code. Version 0.1. Copyright ( ) January FAR-TECH, Inc Science Center Dr., Ste 150. San Diego CA 92121

EBIS-PIC 2D. 2D EBIS Simulation Code. Version 0.1. Copyright ( ) January FAR-TECH, Inc Science Center Dr., Ste 150. San Diego CA 92121 EBIS-PIC 2D 2D EBIS Simulation Code Version 0.1 Copyright ( ) January 2017 by 10350 Science Center Dr., Ste 150 San Diego CA 92121 Phone 858-455-6655 Email support@far-tech.com URL http://www.far-tech.com

More information

Utility Maximizing Routing to Data Centers

Utility Maximizing Routing to Data Centers 0-0 Utility Maximizing Routing to Data Centers M. Sarwat, J. Shin and S. Kapoor (Presented by J. Shin) Sep 26, 2011 Sep 26, 2011 1 Outline 1. Problem Definition - Data Center Allocation 2. How to construct

More information

The additional parameters - a short introduction to the data handling with TRACKKEY 4.1

The additional parameters - a short introduction to the data handling with TRACKKEY 4.1 published in: OnTrack v. 11/1, 19-22 (2001) The additional parameters - a short introduction to the data handling with TRACKKEY 4.1 István Dunkl 1,2 istvan.dunkl@uni-tuebingen.de 1): Institut für Geologie

More information

High-Performance Scientific Computing

High-Performance Scientific Computing High-Performance Scientific Computing Instructor: Randy LeVeque TA: Grady Lemoine Applied Mathematics 483/583, Spring 2011 http://www.amath.washington.edu/~rjl/am583 World s fastest computers http://top500.org

More information