Example Networks Anabela Pereira Tereso February, 2010

Size: px
Start display at page:

Download "Example Networks Anabela Pereira Tereso February, 2010"

Transcription

1 Example Networks Anabela Pereira Tereso February, 00 Note: All the networks are on A-o-A mode of representation. Table 0: Network information summary Network Nº of activities (n) CP length Due date (T) Ratio T CP Unit Delay Cost (c L ) Network Figure : Network

2 Table : Parameters for network Activity Origin Target λ xmin xmax... The first network tested is represented in figure. It is a very simple network, with only activities. The due date of this network T is and the tardiness penalty c L is per unit time. The remaining parameters are represented in table. These parameters are the origin and target node of each activity, the parameter (λ) of the exponential distribution, that represents the Work Content of each activity, and the minimal and maximal amount of resource to allocate to each activity (min and max). The expected duration of activity is /λ =/0. =, and for activity and, 0 and. respectively. In this way, the PERT expected duration for this network is. The due date of the project is selected to be a value above the PERT expected duration (approximately % more). Network Figure : Network

3 Table : Parameters for network Activity Origin Target λ xmin xmax..... This network has activities. The due date is T = 0 and the tardiness cost is c L =. In table there are the remaining parameters. The PERT expected duration for this network is. Network Figure : Network Table : Parameters for network Activity Origin Target λ xmin xmax

4 This network has activities (see figure ). The due date T = and the tardiness cost c L =. The remaining parameters are represented in table. The PERT expected duration for this network is.. Network Figure : Network Table : Parameters for network Activity Origin Target λ xmin xmax This network has activities. For this network, T = 0 and c L =. See table for the remaining parameters. The PERT expected duration for this network is 00.

5 Network 0 Figure : Network Table : Parameters for network Activity 0 Origin Target λ xmin xmax Network (see figure ) is of larger dimension ( activities). For this network, T = (due date) and c L = (tardiness cost). The remaining parameters are presented in table. The PERT expected duration for this network is..

6 Network 0 Figure : Network Table : Parameters for network Activity 0 Origin Target λ xmin xmax This network has activities. The due date is T = and the cost of tardiness is c L =. See table for the rest of the information. The PERT expected duration for this network is.0.

7 Network 0 Figure : Network Table : Parameters for network Activity 0 Origin Target λ xmin xmax Network has one more activity than the last one (see figure ), and different topology. The due date is T = and the tardiness cost c L =. The remaining parameters are presented in table. The PERT expected duration for this network is..

8 Network 0 Figure : Network Table : Parameters for network Activity 0 Origin Target λ xmin xmax This network has activities. T is and c L is. The remaining parameters are presented in table. The PERT expected duration for this network is..

9 Network 0 0 Figure : Network Table : Parameters for network Activity Origin Target λ xmin xmax Activity 0 Origin Target λ xmin xmax Network has the same number of activities as the previous one ( activities). Its due date is and has a tardiness cost of. The other parameters can be seen in table. The PERT expected duration for this network is..

10 Network Figure 0: Network 0 Table 0: Parameters for network 0 Activity Origin Target λ xmin xmax Activity 0 Origin Target λ xmin xmax Network 0 has activities. For this network, T = and c L =. The remaining parameters and represented in table 0. The PERT expected duration for this network is..

11 Network 0 0 Figure : Network Table : Parameters for network Activity Origin Target λ xmin xmax Activity 0 Origin 0 0 Target 0 λ xmin xmax Network can be seen in figure, and it has activities. Here, T = 0 and c L = 0. The remaining parameters are presented in table. The PERT expected duration for this network is 0..

12 Network Figure : Network Table : Parameters for network Activity Origin Target λ xmin xmax Activity 0 Origin Target 0 0 λ xmin xmax Activity 0 Origin 0 Target λ xmin xmax Network can be seen in figure, and it is much bigger than the last one ( activities). For this network, T = and c L =. The remaining parameters are presented in table. The PERT expected duration for this network is.0.

13 Network Figure : Network

14 Table : Parameters for network Activity 0 Origin Target 0 λ xmin xmax Activity 0 Origin 0 Target λ xmin xmax Activity Origin 0 Target λ xmin xmax Activity 0 Origin Target λ xmin xmax Network (see figure ), it s even bigger than the previous ones ( activities). For this network, T = and c L =. The remaining parameters are presented in table. The PERT expected duration for this network is..

15 Network Figure : Network

16 Table : Parameters for network Activity 0 Origin Target λ xmin xmax Activity 0 Origin 0 Target 0 λ xmin xmax Activity 0 Origin 0 Target 0 λ xmin xmax Activity 0 Origin 0 Target 0 λ xmin xmax Activity Origin 0 Target 0 λ xmin xmax Network (see figure ) was the bigger network tested ( activities). For this network, T = and c L =. The remaining parameters are presented in table.

Adaptive resource allocation to stochastic multimodal projects: a distributed platform implementation in Java

Adaptive resource allocation to stochastic multimodal projects: a distributed platform implementation in Java Control and Cybernetics vol. (00) No. Adaptive resource allocation to stochastic multimodal projects: a distributed platform implementation in Java by Anabela P. Tereso, João Ricardo M. Mota and Rui Jorge

More information

Personal Content Caching for Mobiles

Personal Content Caching for Mobiles Personal Content Caching for Mobiles Roy Yates Shweta Jain () Ryoichi Shinkuma (Kyoto University) CNF Network Architecture Opportunistic Transmission & Storage Routing Store Cache popular content Movie1.

More information

ECE SPRING NOTE; This project has two parts which have different due dates.

ECE SPRING NOTE; This project has two parts which have different due dates. DATA STRUCTURES ECE 368 - SPRING 208 PROJECT : Event Driven Simulation for a Multiprocessor System Using a Priority Queue (It is a team project. Note: 2 students/team) ASSIGNMENT DATE: January 23, 208

More information

Statistics & Curve Fitting Tool

Statistics & Curve Fitting Tool Statistics & Curve Fitting Tool This tool allows you to store or edit a list of X and Y data pairs to statistically analyze it. Many statistic figures can be calculated and four models of curve-fitting

More information

Lesson 4 Exponential Functions I

Lesson 4 Exponential Functions I Lesson 4 Exponential Functions I Lesson 4 Exponential Functions I Exponential functions play a major role in our lives. Population growth and disease processes are real-world problems that involve exponential

More information

Lesson 8 - Practice Problems

Lesson 8 - Practice Problems Lesson 8 - Practice Problems Section 8.1: A Case for the Quadratic Formula 1. For each quadratic equation below, show a graph in the space provided and circle the number and type of solution(s) to that

More information

Chapter. Graph Solve. 9-1 Before Using Graph Solve 9-2 Analyzing a Function Graph 9-3 Graph Solve Precautions

Chapter. Graph Solve. 9-1 Before Using Graph Solve 9-2 Analyzing a Function Graph 9-3 Graph Solve Precautions Chapter Graph Solve You can use any of the following methods to analyze function graphs and approximate results. Root extraction Determination of the maximum and minimum Determination of the y-intercept

More information

Organizing and Summarizing Data

Organizing and Summarizing Data Section 2.2 9 Organizing and Summarizing Data Section 2.2 C H A P T E R 2 4 Example 2 (pg. 72) A Histogram for Discrete Data To create a histogram, you have two choices: 1): enter all the individual data

More information

Quadratics Functions: Review

Quadratics Functions: Review Quadratics Functions: Review Name Per Review outline Quadratic function general form: Quadratic function tables and graphs (parabolas) Important places on the parabola graph [see chart below] vertex (minimum

More information

Prediction-Based Admission Control for IaaS Clouds with Multiple Service Classes

Prediction-Based Admission Control for IaaS Clouds with Multiple Service Classes Prediction-Based Admission Control for IaaS Clouds with Multiple Service Classes Marcus Carvalho, Daniel Menascé, Francisco Brasileiro 2015 IEEE Intl. Conf. Cloud Computing Technology and Science Summarized

More information

Evening s Goals. Mathematical Transformations. Discuss the mathematical transformations that are utilized for computer graphics

Evening s Goals. Mathematical Transformations. Discuss the mathematical transformations that are utilized for computer graphics Evening s Goals Discuss the mathematical transformations that are utilized for computer graphics projection viewing modeling Describe aspect ratio and its importance Provide a motivation for homogenous

More information

Power Laws in ALOHA Systems

Power Laws in ALOHA Systems Power Laws in ALOHA Systems E6083: lecture 7 Prof. Predrag R. Jelenković Dept. of Electrical Engineering Columbia University, NY 10027, USA predrag@ee.columbia.edu February 28, 2007 Jelenković (Columbia

More information

A fast Mixed Model B-splines algorithm

A fast Mixed Model B-splines algorithm A fast Mixed Model B-splines algorithm arxiv:1502.04202v1 [stat.co] 14 Feb 2015 Abstract Martin P. Boer Biometris WUR Wageningen The Netherlands martin.boer@wur.nl February 17, 2015 A fast algorithm for

More information

Section 1.6. Inverse Functions

Section 1.6. Inverse Functions Section 1.6 Inverse Functions Important Vocabulary Inverse function: Let f and g be two functions. If f(g(x)) = x in the domain of g and g(f(x) = x for every x in the domain of f, then g is the inverse

More information

Improved Algorithm for Weighted Flow Time

Improved Algorithm for Weighted Flow Time Joint work with Yossi Azar Denition Previous Work and Our Results Overview Single machine receives jobs over time. Each job has an arrival time, a weight and processing time (volume). Allow preemption.

More information

Distributed Clustering Method for Large-Scaled Wavelength-Routed Networks

Distributed Clustering Method for Large-Scaled Wavelength-Routed Networks Distributed Clustering Method for Large-Scaled Wavelength-Routed Networks Yukinobu Fukushima Graduate School of Information and Computer Science Osaka University, Japan 1 Background: Inter-Domain Wavelength-Routed

More information

arxiv: v2 [cs.ni] 23 May 2016

arxiv: v2 [cs.ni] 23 May 2016 Simulation Results of User Behavior-Aware Scheduling Based on Time-Frequency Resource Conversion Hangguan Shan, Yani Zhang, Weihua Zhuang 2, Aiping Huang, and Zhaoyang Zhang College of Information Science

More information

Plot f, x, x min, x max generates a plot of f as a function of x from x min to x max. Plot f 1, f 2,, x, x min, x max plots several functions f i.

Plot f, x, x min, x max generates a plot of f as a function of x from x min to x max. Plot f 1, f 2,, x, x min, x max plots several functions f i. HdPlot.nb In[]:=? Plot Plot f, x, x min, x max generates a plot of f as a function of x from x min to x max. Plot f, f,, x, x min, x max plots several functions f i. In[]:= Plot Sin 7 x Exp x ^, x,, 4.5

More information

Speedup Versus Efficiency in Parallel Systems

Speedup Versus Efficiency in Parallel Systems Speedup Versus Efficiency in Parallel Systems DEREK L. EAGER, JOHN ZAHORJAN, AND EDWARD D. LAZOWSKA Youngsung Kim 2-22-2011 University of Utah Abstract Speedup Can be achieved by executing independent

More information

AN EFFICIENT ADAPTIVE PREDICTIVE LOAD BALANCING METHOD FOR DISTRIBUTED SYSTEMS

AN EFFICIENT ADAPTIVE PREDICTIVE LOAD BALANCING METHOD FOR DISTRIBUTED SYSTEMS AN EFFICIENT ADAPTIVE PREDICTIVE LOAD BALANCING METHOD FOR DISTRIBUTED SYSTEMS ESQUIVEL, S., C. PEREYRA C, GALLARD R. Proyecto UNSL-33843 1 Departamento de Informática Universidad Nacional de San Luis

More information

Types of Functions Here are six common types of functions and examples of each. Linear Quadratic Absolute Value Square Root Exponential Reciprocal

Types of Functions Here are six common types of functions and examples of each. Linear Quadratic Absolute Value Square Root Exponential Reciprocal Topic 2.0 Review Concepts What are non linear equations? Student Notes Unit 2 Non linear Equations Types of Functions Here are six common types of functions and examples of each. Linear Quadratic Absolute

More information

Objectives of this lesson

Objectives of this lesson FONDAMENTI DI INFORMATICA Prof. Luigi Ingrosso Luigi.Maria.Ingrosso@uniroma2.it 04/04/16 Computer Skills - Lesson 4 - L.Ingrosso 2 Objectives of this lesson We ll discuss Vector and matrix introduction

More information

A Deficit Round Robin with Fragmentation Scheduler for Mobile WiMAX

A Deficit Round Robin with Fragmentation Scheduler for Mobile WiMAX A Deficit Round Robin with Fragmentation Scheduler for Mobile WiMAX Chakchai So-In, Raj Jain and Abdel-Karim Al Tammi Washington University in Saint Louis Saint Louis, MO 63130 jain@cse.wustl.edu Presentation

More information

Foundations of Math II

Foundations of Math II Foundations of Math II Unit 6b: Toolkit Functions Academics High School Mathematics 6.6 Warm Up: Review Graphing Linear, Exponential, and Quadratic Functions 2 6.6 Lesson Handout: Linear, Exponential,

More information

Code Software

Code Software My Skype delivers SfB users visibility of their own call quality, user adoption and productivity through dashboards, user maps and reports. It is simply accessed via the Skype for Business client. Each

More information

An Efficient Spectrum Assignment Algorithm Based On Variable-grouping Mechanism For Flex-grid Optical Networks

An Efficient Spectrum Assignment Algorithm Based On Variable-grouping Mechanism For Flex-grid Optical Networks An Efficient Spectrum Assignment Algorithm Based On Variable-grouping Mechanism For Flex-grid Optical Networks Qiu, Yang, Optical Switching and Networking 24 (2017): 39-46. Motivation EONs employ dynamic

More information

Combinatorial Auctions: A Survey by de Vries and Vohra

Combinatorial Auctions: A Survey by de Vries and Vohra Combinatorial Auctions: A Survey by de Vries and Vohra Ashwin Ganesan EE228, Fall 2003 September 30, 2003 1 Combinatorial Auctions Problem N is the set of bidders, M is the set of objects b j (S) is the

More information

Effiziente Designverfahren für optische Laser- und Beleuchtungssysteme

Effiziente Designverfahren für optische Laser- und Beleuchtungssysteme 2015/11/06 Effiziente Designverfahren für optische Laser- und Beleuchtungssysteme Dr. Michael Kuhn, LightTrans GmbH Dr. Stephanie Kunath, Dynardo GmbH LightTrans A Short Overview Founded in 1999 Offices

More information

Calculator Basics TI-83, TI-83 +, TI-84. Index Page

Calculator Basics TI-83, TI-83 +, TI-84. Index Page Calculator Basics TI-83, TI-83 +, TI-84 Index Page Getting Started Page 1 Graphing Page 2 Evaluating Functions page 4 Minimum and Maximum Values Page 5 Table of Values Page 6 Graphing Scatter Plots Page

More information

CS 534: Computer Vision Segmentation II Graph Cuts and Image Segmentation

CS 534: Computer Vision Segmentation II Graph Cuts and Image Segmentation CS 534: Computer Vision Segmentation II Graph Cuts and Image Segmentation Spring 2005 Ahmed Elgammal Dept of Computer Science CS 534 Segmentation II - 1 Outlines What is Graph cuts Graph-based clustering

More information

CHAPTER 3 PROBLEM STATEMENT AND OBJECTIVES

CHAPTER 3 PROBLEM STATEMENT AND OBJECTIVES 64 CHAPTER 3 PROBLEM STATEMENT AND OBJECTIVES 3.1 INTRODUCTION The reality experiences single model assembly line balancing problem as well as mixed-model assembly line balancing problem. If the products

More information

Computer Graphics: 7-Polygon Rasterization, Clipping

Computer Graphics: 7-Polygon Rasterization, Clipping Computer Graphics: 7-Polygon Rasterization, Clipping Prof. Dr. Charles A. Wüthrich, Fakultät Medien, Medieninformatik Bauhaus-Universität Weimar caw AT medien.uni-weimar.de Filling polygons (and drawing

More information

Applied Networks & Security

Applied Networks & Security Applied Networks & Security Wired Local Area Networks (LANs) http://condor.depaul.edu/~jkristof/it263/ John Kristoff jtk@depaul.edu IT 263 Spring 2006/2007 John Kristoff - DePaul University 1 Local Area

More information

Modelling with linear programming

Modelling with linear programming Modelling with linear programming jla@imm.dtu.dk Informatics and Mathematical Modeling Technical University of Denmark 1 Decision models Real world abstraction Model interpretation A model is a carefully

More information

A Multi-Copy Delegation Forwarding Based On Short-term and Long-Term Speed in DTNs

A Multi-Copy Delegation Forwarding Based On Short-term and Long-Term Speed in DTNs A Multi-Copy Delegation Forwarding Based On Short-term and Long-Term Speed in DTNs En Wang, 1,2 Yongjian Yang, 1 Jie Wu, 2 and Wenbin Liu 3 1 Department of Computer Science and Technology, Jilin University,

More information

Applied Networks & Security

Applied Networks & Security Applied Networks & Security Local Area Networks (LANs) http://condor.depaul.edu/~jkristof/it263/ John Kristoff jtk@depaul.edu IT 263 Winter 2006/2007 John Kristoff - DePaul University 1 Local Area Network

More information

Balancing Transport and Physical Layers in Wireless Ad Hoc Networks: Jointly Optimal Congestion Control and Power Control

Balancing Transport and Physical Layers in Wireless Ad Hoc Networks: Jointly Optimal Congestion Control and Power Control Balancing Transport and Physical Layers in Wireless Ad Hoc Networks: Jointly Optimal Congestion Control and Power Control Mung Chiang Electrical Engineering Department, Princeton University NRL/NATO Workshop

More information

Computational Foundations of Cognitive Science. Inverse. Inverse. Inverse Determinant

Computational Foundations of Cognitive Science. Inverse. Inverse. Inverse Determinant Computational Foundations of Cognitive Science Lecture 14: s and in Matlab; Plotting and Graphics Frank Keller School of Informatics University of Edinburgh keller@inf.ed.ac.uk February 23, 21 1 2 3 Reading:

More information

HYDRUS (2D/3D) Computer Session

HYDRUS (2D/3D) Computer Session HYDRUS (2D/3D) Computer Session Three-Dimensional Water Flow and Solute Transport This tutorial considers water flow and solute transport in a simple three-dimensional transport domain. The transport domain

More information

AM 221: Advanced Optimization Spring 2016

AM 221: Advanced Optimization Spring 2016 AM 221: Advanced Optimization Spring 2016 Prof Yaron Singer Lecture 3 February 1st 1 Overview In our previous lecture we presented fundamental results from convex analysis and in particular the separating

More information

Phase-based algorithms for file migration

Phase-based algorithms for file migration Phase-based algorithms for file migration Marcin Bieńkowski Jarek Byrka Marcin Mucha University of Wrocław University of Warsaw HALG 2018 (previously on ICALP 2017) File migration Weighted graph "2 File

More information

A Branch-and-Cut Algorithm for Constrained Graph Clustering

A Branch-and-Cut Algorithm for Constrained Graph Clustering A Branch-and-Cut Algorithm for Constrained Graph Clustering Behrouz Babaki, Dries Van Daele, Bram Weytjens, Tias Guns, Department of Computer Science, KU Leuven, Belgium Department of of Microbial and

More information

ACTIVITY 8. The Bouncing Ball. You ll Need. Name. Date. 1 CBR unit 1 TI-83 or TI-82 Graphing Calculator Ball (a racquet ball works well)

ACTIVITY 8. The Bouncing Ball. You ll Need. Name. Date. 1 CBR unit 1 TI-83 or TI-82 Graphing Calculator Ball (a racquet ball works well) . Name Date ACTIVITY 8 The Bouncing Ball If a ball is dropped from a given height, what does a Height- Time graph look like? How does the velocity change as the ball rises and falls? What affects the shape

More information

Lecture Notes 2: The Simplex Algorithm

Lecture Notes 2: The Simplex Algorithm Algorithmic Methods 25/10/2010 Lecture Notes 2: The Simplex Algorithm Professor: Yossi Azar Scribe:Kiril Solovey 1 Introduction In this lecture we will present the Simplex algorithm, finish some unresolved

More information

Maximizing Restorable Throughput in MPLS Networks

Maximizing Restorable Throughput in MPLS Networks Maximizing Restorable Throughput in MPLS Networks Reuven Cohen Dept. of Computer Science, Technion Gabi Nakibly National EW Research Center 1 Motivation IP networks are required to service real-time applications

More information

Visual debugging with SimpleGeo. Chris Theis

Visual debugging with SimpleGeo. Chris Theis Visual debugging with SimpleGeo Chris Theis Overview SimpleGeo s visual debugger Running a few examples Geometry Geometry errors errors Debugging methods Examples Geometry errors Two types of errors Overlapping

More information

CS123 INTRODUCTION TO COMPUTER GRAPHICS. Clipping. Concepts, Algorithms for line clipping. 1 of 16. Andries van Dam. Clipping - 10/12/17

CS123 INTRODUCTION TO COMPUTER GRAPHICS. Clipping. Concepts, Algorithms for line clipping. 1 of 16. Andries van Dam. Clipping - 10/12/17 Clipping Concepts, Algorithms for line clipping 1 of 16 Line Clipping in 2D Clipping endpoints If x min x x max and y min y y max, the point is inside the clip rectangle. Endpoint analysis for lines: if

More information

1 Programs for phase portrait plotting

1 Programs for phase portrait plotting . 1 Programs for phase portrait plotting We are here looking at how to use our octave programs to make phase portraits of two dimensional systems of ODE, adding automatically or halfautomatically arrows

More information

Total Orders. Lecture 41 Section 8.5. Robb T. Koether. Hampden-Sydney College. Mon, Apr 8, 2013

Total Orders. Lecture 41 Section 8.5. Robb T. Koether. Hampden-Sydney College. Mon, Apr 8, 2013 Total Orders Lecture 41 Section 8.5 Robb T. Koether Hampden-Sydney College Mon, Apr 8, 2013 Robb T. Koether (Hampden-Sydney College) Total Orders Mon, Apr 8, 2013 1 / 30 1 Total Orders 2 Topological Sorting

More information

Mutations for Permutations

Mutations for Permutations Mutations for Permutations Insert mutation: Pick two allele values at random Move the second to follow the first, shifting the rest along to accommodate Note: this preserves most of the order and adjacency

More information

Towards Construction of Efficient and Optimally Resilient VPN Topologies by Exactly Calculating Maximum Disjoint Paths

Towards Construction of Efficient and Optimally Resilient VPN Topologies by Exactly Calculating Maximum Disjoint Paths Towards Construction of Efficient and Optimally Resilient VPN Topologies by Exactly Calculating Maximum Disjoint Paths Martin Backhaus, Günter Schäfer Technische Universität Ilmenau, Germany Telematics/Computer

More information

NAG Library Function Document nag_1d_cheb_intg (e02ajc)

NAG Library Function Document nag_1d_cheb_intg (e02ajc) 1 Purpose NAG Library Function Document nag_1d_cheb_intg () nag_1d_cheb_intg () determines the coefficients in the Chebyshev series representation of the indefinite integral of a polynomial given in Chebyshev

More information

End-To-End Delay Optimization in Wireless Sensor Network (WSN)

End-To-End Delay Optimization in Wireless Sensor Network (WSN) Shweta K. Kanhere 1, Mahesh Goudar 2, Vijay M. Wadhai 3 1,2 Dept. of Electronics Engineering Maharashtra Academy of Engineering, Alandi (D), Pune, India 3 MITCOE Pune, India E-mail: shweta.kanhere@gmail.com,

More information

On Static and Dynamic Partitioning Behavior of Large-Scale Networks

On Static and Dynamic Partitioning Behavior of Large-Scale Networks On Static and Dynamic Partitioning Behavior of Large-Scale Networks Derek Leonard Department of Computer Science Texas A&M University College Station, TX 77843 27th October 2005 Derek Leonard On Static

More information

Unit: Quadratic Functions

Unit: Quadratic Functions Unit: Quadratic Functions Learning increases when you have a goal to work towards. Use this checklist as guide to track how well you are grasping the material. In the center column, rate your understand

More information

Deadline Guaranteed Service for Multi- Tenant Cloud Storage Guoxin Liu and Haiying Shen

Deadline Guaranteed Service for Multi- Tenant Cloud Storage Guoxin Liu and Haiying Shen Deadline Guaranteed Service for Multi- Tenant Cloud Storage Guoxin Liu and Haiying Shen Presenter: Haiying Shen Associate professor *Department of Electrical and Computer Engineering, Clemson University,

More information

Linear Programming: A Geometric Approach

Linear Programming: A Geometric Approach Chapter 3 Linear Programming: A Geometric Approach 3.1 Graphing Systems of Linear Inequalities in Two Variables The general form for a line is ax + by + c =0. The general form for a linear inequality is

More information

The parametric equation below represents a ball being thrown straight up. x(t) = 3 y(t) = 96t! 16t 2

The parametric equation below represents a ball being thrown straight up. x(t) = 3 y(t) = 96t! 16t 2 1 TASK 3.1.2: THROWING Solutions The parametric equation below represents a ball being thrown straight up. x(t) = 3 y(t) = 96t! 16t 2 1. What do you think the graph will look like? Make a sketch below.

More information

Accelerating Simulink Optimization, Code Generation & Test Automation Through Parallelization

Accelerating Simulink Optimization, Code Generation & Test Automation Through Parallelization Accelerating Simulink Optimization, Code Generation & Test Automation Through Parallelization Ryan Chladny Application Engineering May 13 th, 2014 2014 The MathWorks, Inc. 1 Design Challenge: Electric

More information

LAB 10: Configure BGP Route Dampening

LAB 10: Configure BGP Route Dampening BGP BGP Topology Page1 LAB 10: Configure BGP Route Dampening Task 1: Configure IPv4 BGP Process for Autonomous Step 1. In the configuration mode of router configure IPv4 BGP Process by following command:

More information

Lesson 11 Rational Functions

Lesson 11 Rational Functions Lesson 11 Rational Functions In this lesson, you will embark on a study of rational functions. These may be unlike any function you have ever seen. Rational functions look different because they are in

More information

Physics 736. Experimental Methods in Nuclear-, Particle-, and Astrophysics. - Statistics and Error Analysis -

Physics 736. Experimental Methods in Nuclear-, Particle-, and Astrophysics. - Statistics and Error Analysis - Physics 736 Experimental Methods in Nuclear-, Particle-, and Astrophysics - Statistics and Error Analysis - Karsten Heeger heeger@wisc.edu Feldman&Cousin what are the issues they deal with? what processes

More information

Lesson 8 Practice Problems

Lesson 8 Practice Problems Name: Date: Lesson 8 Section 8.1: Characteristics of Quadratic Functions 1. For each of the following quadratic functions: Identify the coefficients a, b, c Determine if the parabola opens up or down and

More information

MINI LESSON. Lesson 1a Introduction to Functions

MINI LESSON. Lesson 1a Introduction to Functions MINI LESSON Lesson 1a Introduction to Functions Lesson Objectives: 1. Define FUNCTION 2. Determine if data sets, graphs, statements, or sets of ordered pairs define functions 3. Use proper function notation

More information

Creating a Basic A/V presentation

Creating a Basic A/V presentation Morriston Camera Club Pictures to Exe Version 6.5 Creating a Basic A/V presentation Setting the Project Options. Main Ensure Synchronize music and slides is checked, and set the time interval to 5secs.

More information

Years after US Student to Teacher Ratio

Years after US Student to Teacher Ratio The goal of this assignment is to create a scatter plot of a set of data. You could do this with any two columns of data, but for demonstration purposes we ll work with the data in the table below. The

More information

Numerical Integration & Area Under a Curve

Numerical Integration & Area Under a Curve Kevin Fitzpatrick CC Edwards Evaluating 2 (1.5x 2 x) dx on the Home Evaluating 2 (1.5x 2 x) dx on the Home 0 0 screen: screen: 1. Press MENU and 1 to select the RUN screen. (That s the main calculation

More information

Discrete-Event Simulation:

Discrete-Event Simulation: Discrete-Event Simulation: A First Course Section 32: Multi-Stream Lehmer RNGs Section 32: Multi-Stream Lehmer RNGs Discrete-Event Simulation c 2006 Pearson Ed, Inc 0-13-142917-5 Section 32: Multi-Stream

More information

Setting a Window - Finding One That Works. You can enter the dimensions of the graph by accessing button you will see a window like the one below.

Setting a Window - Finding One That Works. You can enter the dimensions of the graph by accessing button you will see a window like the one below. A. Overview 1. WINDOW Setting a Window - Finding One That Works You can enter the dimensions of the graph by accessing button you will see a window like the one below.. When you use this The Xmin and Xmax

More information

Computer Graphics (CS 543) Lecture 9 (Part 2): Clipping. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)

Computer Graphics (CS 543) Lecture 9 (Part 2): Clipping. Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI) Computer Graphics (CS 543) Lecture 9 (Part 2): Clipping Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) OpenGL Stages After projection, several stages before objects drawn

More information

Software interface Talren v5

Software interface Talren v5 2015 Software interface Talren v5 Summary Introduction General presentation Input data Wizards and et data basis Calculation stages 2015 Terrasol - Talren v5 Interface 2 General presentation Toolbar Drawing

More information

COMP Summer 2015 (A01) Jim (James) Young jimyoung.ca

COMP Summer 2015 (A01) Jim (James) Young jimyoung.ca COMP 1010- Summer 2015 (A01) Jim (James) Young young@cs.umanitoba.ca jimyoung.ca Hello! James (Jim) Young young@cs.umanitoba.ca jimyoung.ca office hours T / Th: 17:00 18:00 EITC-E2-582 (or by appointment,

More information

Dilations With Matrices

Dilations With Matrices About the Lesson In this activity, students use matrices to perform dilations centered at the origin of triangles. As a result, students will: Explore the effect of the scale factor on the size relationship

More information

NAG Library Routine Document G01AJF.1

NAG Library Routine Document G01AJF.1 NAG Library Routine Document Note: before using this routine, please read the Users Note for your implementation to check the interpretation of bold italicised terms and other implementation-dependent

More information

Sensor Scheduling and Energy Allocation For Lifetime Maximization in User-Centric Visual Sensor Networks

Sensor Scheduling and Energy Allocation For Lifetime Maximization in User-Centric Visual Sensor Networks 1 Sensor Scheduling and Energy Allocation For Lifetime Maximization in User-Centric Visual Sensor Networks Chao Yu IP Lab, University of Rochester December 4, 2008 2 1 Introduction User-Centric VSN Camera

More information

Section 3.2: Multi Stream Lehmer RNGs

Section 3.2: Multi Stream Lehmer RNGs Section 32: Multi Stream Lehmer RNGs Discrete-Event Simulation: A First Course c 2006 Pearson Ed, Inc 0-13-142917-5 Discrete-Event Simulation: A First Course Section 32: Multi Stream Lehmer RNGs 1/ 19

More information

Network Design for QoS under IEEE ( Zigbee ) CSMA/CA for Internet of Things Applications

Network Design for QoS under IEEE ( Zigbee ) CSMA/CA for Internet of Things Applications Network Design for QoS under IEEE 802.15.4 ( Zigbee ) CSMA/CA for Internet of Things Applications EECS Symposium Abhijit Bhattacharya Advisor: Prof. Anurag Kumar Dept. of ECE, IISc, Bangalore April 28,

More information

Chapter. 9-1 Before Using Graph Solve 9-2 Analyzing a Function Graph

Chapter. 9-1 Before Using Graph Solve 9-2 Analyzing a Function Graph Chapter Graph Solve You can use any of the folloing methods to analyze function graphs and approximate results. Calculating the root Determination of the local maximum value and local minimum value Determination

More information

Getting Started with the TI-83/TI-84 Plus Family of Calculators

Getting Started with the TI-83/TI-84 Plus Family of Calculators Appendix C Getting Started with the TI-83/TI-84 Plus Family of Calculators ON-OFF To turn on the calculator, press the ON key. To turn off the calculator, press 2nd and then ON. Most keys on the calculator

More information

FLEXIBLE ASSEMBLY SYSTEMS

FLEXIBLE ASSEMBLY SYSTEMS FLEXIBLE ASSEMBLY SYSTEMS Job Shop and Flexible Assembly Job Shop Each job has an unique identity Make to order, low volume environment Possibly complicated route through system Very difficult Flexible

More information

Section 1.4: Graphing Calculators and Computers

Section 1.4: Graphing Calculators and Computers Section 1.4: Graphing Calculators and Computers In this section we shall show some of the was that calculators can help us in mathematics. 1. Calculator Warnings Before we even consider how a calculator

More information

Chapter 2 Exploring Data with Graphs and Numerical Summaries

Chapter 2 Exploring Data with Graphs and Numerical Summaries Chapter 2 Exploring Data with Graphs and Numerical Summaries Constructing a Histogram on the TI-83 Suppose we have a small class with the following scores on a quiz: 4.5, 5, 5, 6, 6, 7, 8, 8, 8, 8, 9,

More information

Performance Analysis of Storage-Based Routing for Circuit-Switched Networks [1]

Performance Analysis of Storage-Based Routing for Circuit-Switched Networks [1] Performance Analysis of Storage-Based Routing for Circuit-Switched Networks [1] Presenter: Yongcheng (Jeremy) Li PhD student, School of Electronic and Information Engineering, Soochow University, China

More information

Packet multiple access and the Aloha protocol

Packet multiple access and the Aloha protocol Packet multiple access and the Aloha protocol Massachusetts Institute of Technology Department of Aeronautics and Astronautics Slide 1 Packet Multiple Access PMA SHARED UPLINK TERMINAL TERMINAL APPL TRANS

More information

Solving Large Aircraft Landing Problems on Multiple Runways by Applying a Constraint Programming Approach

Solving Large Aircraft Landing Problems on Multiple Runways by Applying a Constraint Programming Approach Solving Large Aircraft Landing Problems on Multiple Runways by Applying a Constraint Programming Approach Amir Salehipour School of Mathematical and Physical Sciences, The University of Newcastle, Australia

More information

Dynamic Content Allocation for Cloudassisted Service of Periodic Workloads

Dynamic Content Allocation for Cloudassisted Service of Periodic Workloads Dynamic Content Allocation for Cloudassisted Service of Periodic Workloads György Dán Royal Institute of Technology (KTH) Niklas Carlsson Linköping University @ IEEE INFOCOM 2014, Toronto, Canada, April/May

More information

ISE203 Optimization 1 Linear Models. Dr. Arslan Örnek Chapter 4 Solving LP problems: The Simplex Method SIMPLEX

ISE203 Optimization 1 Linear Models. Dr. Arslan Örnek Chapter 4 Solving LP problems: The Simplex Method SIMPLEX ISE203 Optimization 1 Linear Models Dr. Arslan Örnek Chapter 4 Solving LP problems: The Simplex Method SIMPLEX Simplex method is an algebraic procedure However, its underlying concepts are geometric Understanding

More information

A NEW APPROACH TO FULLY FUZZY

A NEW APPROACH TO FULLY FUZZY 44 CHAPTER 4 A NEW APPROACH TO FULLY FUZZY TIME-COST TRADE-OFF IN A PROJECT NETWORK 4.1 INTRODUCTION Project management involves project scheduling, planning, evaluating and controlling. Activity networks

More information

Chapter. Graph-to-Table

Chapter. Graph-to-Table Chapter Graph-to-Table With this function, the screen shows both a graph and a table. You can move a pointer around the graph and store its current coordinates inside the table whenever you want. This

More information

Department of Mathematics Oleg Burdakov of 30 October Consider the following linear programming problem (LP):

Department of Mathematics Oleg Burdakov of 30 October Consider the following linear programming problem (LP): Linköping University Optimization TAOP3(0) Department of Mathematics Examination Oleg Burdakov of 30 October 03 Assignment Consider the following linear programming problem (LP): max z = x + x s.t. x x

More information

Graphing Polar equations.notebook January 10, 2014

Graphing Polar equations.notebook January 10, 2014 graphing polar equations Ch.8 Lesson 2 1 2 3 4 Target Agenda Purpose Evaluation TSWBAT: convert equations to polar, graph a polar equation on the polar plane by recognizing the forms Warm-Up/Homework Check

More information

A Dynamic TDMA Protocol Utilizing Channel Sense

A Dynamic TDMA Protocol Utilizing Channel Sense International Conference on Electromechanical Control Technology and Transportation (ICECTT 2015) A Dynamic TDMA Protocol Utilizing Channel Sense ZHOU De-min 1, a, LIU Yun-jiang 2,b and LI Man 3,c 1 2

More information

data block 0, word 0 block 0, word 1 block 1, word 0 block 1, word 1 block 2, word 0 block 2, word 1 block 3, word 0 block 3, word 1 Word index cache

data block 0, word 0 block 0, word 1 block 1, word 0 block 1, word 1 block 2, word 0 block 2, word 1 block 3, word 0 block 3, word 1 Word index cache Taking advantage of spatial locality Use block size larger than one word Example: two words Block index tag () () Alternate representations Word index tag block, word block, word block, word block, word

More information

MODELING OF SMART GRID TRAFFICS USING NON- PREEMPTIVE PRIORITY QUEUES

MODELING OF SMART GRID TRAFFICS USING NON- PREEMPTIVE PRIORITY QUEUES MODELING OF SMART GRID TRAFFICS USING NON- PREEMPTIVE PRIORITY QUEUES Contents Smart Grid Model and Components. Future Smart grid components. Classification of Smart Grid Traffic. Brief explanation of

More information

Enhanced SLA-Tree Algorithm to Support Incremental Tree Building

Enhanced SLA-Tree Algorithm to Support Incremental Tree Building Enhanced SLA-Tree Algorithm to Support Incremental Tree Building Rohit Gupta 1, Tushar Champaneria 2 Abstract Cloud computing is revolutionize technology which make it possible to deliver computing service

More information

Physics 736. Experimental Methods in Nuclear-, Particle-, and Astrophysics. Lecture 14

Physics 736. Experimental Methods in Nuclear-, Particle-, and Astrophysics. Lecture 14 Physics 736 Experimental Methods in Nuclear-, Particle-, and Astrophysics Lecture 14 Karsten Heeger heeger@wisc.edu Course Schedule and Reading course website http://neutrino.physics.wisc.edu/teaching/phys736/

More information

CS 543: Computer Graphics. Projection

CS 543: Computer Graphics. Projection CS 543: Computer Graphics Projection Robert W. Lindeman Associate Professor Interactive Media & Game Development Department of Computer Science Worcester Poltechnic Institute gogo@wpi.edu with lots of

More information

Physics 736. Experimental Methods in Nuclear-, Particle-, and Astrophysics. - Statistical Methods -

Physics 736. Experimental Methods in Nuclear-, Particle-, and Astrophysics. - Statistical Methods - Physics 736 Experimental Methods in Nuclear-, Particle-, and Astrophysics - Statistical Methods - Karsten Heeger heeger@wisc.edu Course Schedule and Reading course website http://neutrino.physics.wisc.edu/teaching/phys736/

More information

Delayed reservation decision in optical burst switching networks with optical buffers

Delayed reservation decision in optical burst switching networks with optical buffers Delayed reservation decision in optical burst switching networks with optical buffers G.M. Li *, Victor O.K. Li + *School of Information Engineering SHANDONG University at WEIHAI, China + Department of

More information

Lagrange Multipliers

Lagrange Multipliers Lagrange Multipliers Christopher Croke University of Pennsylvania Math 115 How to deal with constrained optimization. How to deal with constrained optimization. Let s revisit the problem of finding the

More information