Topic 7 Random Variables and Distribution Functions

Size: px
Start display at page:

Download "Topic 7 Random Variables and Distribution Functions"

Transcription

1 Definition of a Random Vaiable Distibution Functions Popeties of Distibution Functions Topic 7 Random Vaiables and Distibution Functions Distibution Functions 1 / 11

2 Definition of a Random Vaiable Distibution Functions Popeties of Distibution Functions Outline Definition of a Random Vaiable Distibution Functions Discete Random Vaiables Continuous Random Vaiables Popeties of Distibution Functions 2 / 11

3 Definition of a Random Vaiable Distibution Functions Popeties of Distibution Functions Intoduction statistics univese of infomation ask a question and collect data oganize into the empiical cumulative distibution function compute sample means and vaiances pobability sample space - Ω and pobability - P define a andom vaiable X oganize into the cumulative distibution function compute distibutional means and vaiances 3 / 11

4 Definition of a Random Vaiable Distibution Functions Popeties of Distibution Functions Definition of a Random Vaiable A andom vaiable is a eal valued function fom the pobability space. X : Ω R. Typically, we shall use capital lettes nea the end of the alphabet, e.g., X, Y, Z fo andom vaiables. The ange of a andom vaiable is called the state space. Execise. Give some andom vaiables on the following pobability spaces, Ω. 1. Roll a die 3 times and conside the sample space Ω = {(i, j, k); i, j, k = 1, 2, 3, 4, 5, 6}. 2. Flip a coin 10 times and conside the sample space Ω, the set of 10-tuples of heads and tails. We can ceate new andom vaiables via composition of functions: ω X (ω) g(x (ω)) Thus, if X is a andom vaiable, then so ae X 2, exp αx, X 2 + 1, tan 2 X, X 4 / 11

5 Definition of a Random Vaiable Distibution Functions Popeties of Distibution Functions Distibution Functions A (cumulative) distibution function of a andom vaiable X is defined by F X (x) = P{ω Ω; X (ω) x} = P{X x}. Fo the complement of {X x}, we have the suvival function F X (x) = P{X > x} = 1 P{X x} = 1 F X (x). Choose a < b, then the event {X a} {X b}. Thei set theoetic diffeence {X b} \ {X a} = {a < X b}. Consequently, by the diffeence ule fo pobabilities, P{a < X b} = P({X b} \ {X a}) = P{X b} P{X a} = F X (b) F X (a). In paticula, F X is non-deceasing. 5 / 11

6 and less than o equal to b. Consequently, by the diffeence ule fo pobabilities, Definition of a Random Vaiable Distibution Functions Popeties of Distibution Functions P {a <Xapple b} = P ({X apple b}\{x apple a}) =P {X apple b} P {X apple a} = F X(b) F X(a). (7.2) Distibution Functions Thus, we can compute the pobability that a andom vaiable takes values in an inteval by subtacting the distibution function evaluated at the endpoints of the intevals. Cae is needed on the issue of the inclusion o exclusion of the endpoints of the inteval. Let X be the sum of the values on two fai dice, Example 7.8. To give the cumulative distibution function fo X, the sum of the values fo two olls of a die, we stat with the table x x P{X = x} 1/36 2/36 3/36 4/36 5/36 6/36 5/36 4/36 3/36 2/36 1/36 P {X = x} 1/36 2/36 3/36 4/36 5/36 6/36 5/36 4/36 3/36 2/36 1/36 Hee is F X and the ceate cumulative the gaph. distibution function. 1 3/4 6 1/2 1/ Figue 7.1: Gaph of FX, the cumulative distibution function fo the sum of the values fo two olls of a die. 6 / 11

7 Definition of a Random Vaiable Distibution Functions Popeties of Distibution Functions Distibution Functions Notice that the distibution function is constant in between the possible values fo X, has a jump size at x is equal to P{X = x}, and is ight continuous. Call X a discete andom vaiable if its distibution function F X has these popeties. Examples = P{X = 4} = F X (4) F X (4 ) = P{4 < X 7} = F X (7) F X (4) = = = P{4 X 7} = F X (7) F X (4 ) = = = / 11

8 Definition of a Random Vaiable Distibution Functions Popeties of Distibution Functions Distibution Functions Execise. 1. Flip a fai coins 3 times. Let X be the numbe of heads. Unde equally likely outcomes, find P{X = x} fo x = 0, 1, 2, and 3. and use this to sketch a gaph of the distibution function F X. 2. Deal 5 cads out of a deck of 52. Let X be the numbe of. Unde equally likely outcomes, use the choose function in R to detemine P{X = x} fo x = 0, 1, 2, 3, 4, and 5. and use this to sketch a gaph of the distibution function F X. 8 / 11

9 Definition of a Random Vaiable Distibution Functions Popeties of Distibution Functions Distibution Functions Fo a dat boad with adius 1, assume that the dat lands andomly unifomly. Let X be the distance fom the cente. Fo x [0, 1], F X (x) = P{X x} = aea inside cicle of adius x aea of cicle = πx 2 π1 2 = x 2. Thus, we have the distibution function 0 if x 0, F X (x) = x 2 if 0 < x 1, 1 if x > 1. pobability !0.2!0.4!0.6!0.8! !1!0.8!0.6!0.4! x x 9 / 11

10 Definition of a Random Vaiable Distibution Functions Popeties of Distibution Functions Distibution Functions Execise. 1. Find the pobability that the dat no moe than 1/2 unit fom the cente. 2. Find the pobability that the dat lands futhe 1/3 unit but no moe than 2/3 unit fom the cente. 3. Find the median, x 1/2 so that P{X x 1/2 } = 1/2. Definition. X is continuous andom vaiable if it has a cumulative distibution function F X that is diffeentiable. 10 / 11

11 Definition of a Random Vaiable Distibution Functions Popeties of Distibution Functions Popeties of Distibution Functions A distibution function F X has the popety that it is ight continuous, stats at 0, ends at 1, and does not decease with inceasing values of x. In mathematical tems, Fo evey a, lim x a+ F X (x) = F X (a). lim x F X (x) = 0. lim x F X (x) = 1. Fo evey a, b satisfying a < b, F X (a) F x (b). distibution function x 11 / 11

DISTRIBUTION MIXTURES

DISTRIBUTION MIXTURES Application Example 7 DISTRIBUTION MIXTURES One fequently deals with andom vaiables the distibution of which depends on vaious factos. One example is the distibution of atmospheic paametes such as wind

More information

Concomitants of Upper Record Statistics for Bivariate Pseudo Weibull Distribution

Concomitants of Upper Record Statistics for Bivariate Pseudo Weibull Distribution Available at http://pvamuedu/aam Appl Appl Math ISSN: 93-9466 Vol 5, Issue (Decembe ), pp 8 9 (Peviously, Vol 5, Issue, pp 379 388) Applications and Applied Mathematics: An Intenational Jounal (AAM) Concomitants

More information

Image Enhancement in the Spatial Domain. Spatial Domain

Image Enhancement in the Spatial Domain. Spatial Domain 8-- Spatial Domain Image Enhancement in the Spatial Domain What is spatial domain The space whee all pixels fom an image In spatial domain we can epesent an image by f( whee x and y ae coodinates along

More information

Lecture # 04. Image Enhancement in Spatial Domain

Lecture # 04. Image Enhancement in Spatial Domain Digital Image Pocessing CP-7008 Lectue # 04 Image Enhancement in Spatial Domain Fall 2011 2 domains Spatial Domain : (image plane) Techniques ae based on diect manipulation of pixels in an image Fequency

More information

= dv 3V (r + a 1) 3 r 3 f(r) = 1. = ( (r + r 2

= dv 3V (r + a 1) 3 r 3 f(r) = 1. = ( (r + r 2 Random Waypoint Model in n-dimensional Space Esa Hyytiä and Joma Vitamo Netwoking Laboatoy, Helsinki Univesity of Technology, Finland Abstact The andom waypoint model (RWP) is one of the most widely used

More information

RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES

RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES Svetlana Avetisyan Mikayel Samvelyan* Matun Kaapetyan Yeevan State Univesity Abstact In this pape, the class

More information

Topic -3 Image Enhancement

Topic -3 Image Enhancement Topic -3 Image Enhancement (Pat 1) DIP: Details Digital Image Pocessing Digital Image Chaacteistics Spatial Spectal Gay-level Histogam DFT DCT Pe-Pocessing Enhancement Restoation Point Pocessing Masking

More information

Title. Author(s)NOMURA, K.; MOROOKA, S. Issue Date Doc URL. Type. Note. File Information

Title. Author(s)NOMURA, K.; MOROOKA, S. Issue Date Doc URL. Type. Note. File Information Title CALCULATION FORMULA FOR A MAXIMUM BENDING MOMENT AND THE TRIANGULAR SLAB WITH CONSIDERING EFFECT OF SUPPO UNIFORM LOAD Autho(s)NOMURA, K.; MOROOKA, S. Issue Date 2013-09-11 Doc URL http://hdl.handle.net/2115/54220

More information

Topological Characteristic of Wireless Network

Topological Characteristic of Wireless Network Topological Chaacteistic of Wieless Netwok Its Application to Node Placement Algoithm Husnu Sane Naman 1 Outline Backgound Motivation Papes and Contibutions Fist Pape Second Pape Thid Pape Futue Woks Refeences

More information

A New Finite Word-length Optimization Method Design for LDPC Decoder

A New Finite Word-length Optimization Method Design for LDPC Decoder A New Finite Wod-length Optimization Method Design fo LDPC Decode Jinlei Chen, Yan Zhang and Xu Wang Key Laboatoy of Netwok Oiented Intelligent Computation Shenzhen Gaduate School, Habin Institute of Technology

More information

2. PROPELLER GEOMETRY

2. PROPELLER GEOMETRY a) Fames of Refeence 2. PROPELLER GEOMETRY 10 th Intenational Towing Tank Committee (ITTC) initiated the pepaation of a dictionay and nomenclatue of ship hydodynamic tems and this wok was completed in

More information

Conservation Law of Centrifugal Force and Mechanism of Energy Transfer Caused in Turbomachinery

Conservation Law of Centrifugal Force and Mechanism of Energy Transfer Caused in Turbomachinery Poceedings of the 4th WSEAS Intenational Confeence on luid Mechanics and Aeodynamics, Elounda, Geece, August 1-3, 006 (pp337-34) Consevation Law of Centifugal oce and Mechanism of Enegy Tansfe Caused in

More information

ISyE 4256 Industrial Robotic Applications

ISyE 4256 Industrial Robotic Applications ISyE 456 Industial Robotic Applications Quiz # Oct. 9, 998 Name This is a closed book, closed notes exam. Show wok fo poblem questions ) ( pts) Please cicle one choice fo each item. a) In an application,

More information

POMDP: Introduction to Partially Observable Markov Decision Processes Hossein Kamalzadeh, Michael Hahsler

POMDP: Introduction to Partially Observable Markov Decision Processes Hossein Kamalzadeh, Michael Hahsler POMDP: Intoduction to Patially Obsevable Makov Decision Pocesses Hossein Kamalzadeh, Michael Hahsle 2019-01-02 The R package pomdp povides an inteface to pomdp-solve, a solve (witten in C) fo Patially

More information

Mobility Pattern Recognition in Mobile Ad-Hoc Networks

Mobility Pattern Recognition in Mobile Ad-Hoc Networks Mobility Patten Recognition in Mobile Ad-Hoc Netwoks S. M. Mousavi Depatment of Compute Engineeing, Shaif Univesity of Technology sm_mousavi@ce.shaif.edu H. R. Rabiee Depatment of Compute Engineeing, Shaif

More information

Modeling Spatially Correlated Data in Sensor Networks

Modeling Spatially Correlated Data in Sensor Networks Modeling Spatially Coelated Data in Senso Netwoks Apoova Jindal and Konstantinos Psounis Univesity of Southen Califonia The physical phenomena monitoed by senso netwoks, e.g. foest tempeatue, wate contamination,

More information

On a piece of graph paper, draw a circle that has a radius of 5 and center at ( 0, 0 ).

On a piece of graph paper, draw a circle that has a radius of 5 and center at ( 0, 0 ). 10.1 Stat Thinking On a piece of gaph pape, daw a cicle that has a adius of 5 and cente at ( 0, 0 ). 1. aw the segment that connects the points ( 3, 4 ) and ( 4, 3) on the cicle. Is this segment a diamete?

More information

Complete Solution to Potential and E-Field of a sphere of radius R and a charge density ρ[r] = CC r 2 and r n

Complete Solution to Potential and E-Field of a sphere of radius R and a charge density ρ[r] = CC r 2 and r n Complete Solution to Potential and E-Field of a sphee of adius R and a chage density ρ[] = CC 2 and n Deive the electic field and electic potential both inside and outside of a sphee of adius R with a

More information

Analysis of Wired Short Cuts in Wireless Sensor Networks

Analysis of Wired Short Cuts in Wireless Sensor Networks Analysis of Wied Shot Cuts in Wieless Senso Netwos ohan Chitaduga Depatment of Electical Engineeing, Univesity of Southen Califonia, Los Angeles 90089, USA Email: chitadu@usc.edu Ahmed Helmy Depatment

More information

Modeling spatially-correlated data of sensor networks with irregular topologies

Modeling spatially-correlated data of sensor networks with irregular topologies This full text pape was pee eviewed at the diection of IEEE Communications Society subject matte expets fo publication in the IEEE SECON 25 poceedings Modeling spatially-coelated data of senso netwoks

More information

FACE VECTORS OF FLAG COMPLEXES

FACE VECTORS OF FLAG COMPLEXES FACE VECTORS OF FLAG COMPLEXES ANDY FROHMADER Abstact. A conjectue of Kalai and Eckhoff that the face vecto of an abitay flag complex is also the face vecto of some paticula balanced complex is veified.

More information

Gravitational Shift for Beginners

Gravitational Shift for Beginners Gavitational Shift fo Beginnes This pape, which I wote in 26, fomulates the equations fo gavitational shifts fom the elativistic famewok of special elativity. Fist I deive the fomulas fo the gavitational

More information

Controlled Information Maximization for SOM Knowledge Induced Learning

Controlled Information Maximization for SOM Knowledge Induced Learning 3 Int'l Conf. Atificial Intelligence ICAI'5 Contolled Infomation Maximization fo SOM Knowledge Induced Leaning Ryotao Kamimua IT Education Cente and Gaduate School of Science and Technology, Tokai Univeisity

More information

9.5 Volume of Pyramids

9.5 Volume of Pyramids 9.5 Volume of Pyamids and Cones Goal Find the volumes of pyamids and cones. Key Wods pyamid p. 49 cone p. 49 volume p. 500 In the puzzle below, you can see that the squae pism can be made using thee conguent

More information

Comparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters

Comparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters Compaisons of Tansient Analytical Methods fo Detemining Hydaulic Conductivity Using Disc Pemeametes 1,,3 Cook, F.J. 1 CSRO Land and Wate, ndoooopilly, Queensland The Univesity of Queensland, St Lucia,

More information

AN ANALYSIS OF COORDINATED AND NON-COORDINATED MEDIUM ACCESS CONTROL PROTOCOLS UNDER CHANNEL NOISE

AN ANALYSIS OF COORDINATED AND NON-COORDINATED MEDIUM ACCESS CONTROL PROTOCOLS UNDER CHANNEL NOISE AN ANALYSIS OF COORDINATED AND NON-COORDINATED MEDIUM ACCESS CONTROL PROTOCOLS UNDER CHANNEL NOISE Tolga Numanoglu, Bulent Tavli, and Wendi Heinzelman Depatment of Electical and Compute Engineeing Univesity

More information

Survey of Various Image Enhancement Techniques in Spatial Domain Using MATLAB

Survey of Various Image Enhancement Techniques in Spatial Domain Using MATLAB Suvey of Vaious Image Enhancement Techniques in Spatial Domain Using MATLAB Shailenda Singh Negi M.Tech Schola G. B. Pant Engineeing College, Paui Gahwal Uttaahand, India- 46194 ABSTRACT Image Enhancement

More information

UCLA Papers. Title. Permalink. Authors. Publication Date. Localized Edge Detection in Sensor Fields. https://escholarship.org/uc/item/3fj6g58j

UCLA Papers. Title. Permalink. Authors. Publication Date. Localized Edge Detection in Sensor Fields. https://escholarship.org/uc/item/3fj6g58j UCLA Papes Title Localized Edge Detection in Senso Fields Pemalink https://escholashipog/uc/item/3fj6g58j Authos K Chintalapudi Govindan Publication Date 3-- Pee eviewed escholashipog Poweed by the Califonia

More information

On the Forwarding Area of Contention-Based Geographic Forwarding for Ad Hoc and Sensor Networks

On the Forwarding Area of Contention-Based Geographic Forwarding for Ad Hoc and Sensor Networks On the Fowading Aea of Contention-Based Geogaphic Fowading fo Ad Hoc and Senso Netwoks Dazhi Chen Depatment of EECS Syacuse Univesity Syacuse, NY dchen@sy.edu Jing Deng Depatment of CS Univesity of New

More information

IP Network Design by Modified Branch Exchange Method

IP Network Design by Modified Branch Exchange Method Received: June 7, 207 98 IP Netwok Design by Modified Banch Method Kaiat Jaoenat Natchamol Sichumoenattana 2* Faculty of Engineeing at Kamphaeng Saen, Kasetsat Univesity, Thailand 2 Faculty of Management

More information

Computer Vision - Histogram Processing. Dr. S. Das IIT Madras, CHENNAI - 36

Computer Vision - Histogram Processing. Dr. S. Das IIT Madras, CHENNAI - 36 Comute Viion - Hitogam Poceing D. S. Da IIT Mada, CHENNAI - 36 HISTOGRAM In a gay level image the obabilitie aigned to each gay level can be given by the elation: n, N Inut image,,2...l - - The nomalized

More information

DYNAMIC STORAGE ALLOCATION. Hanan Samet

DYNAMIC STORAGE ALLOCATION. Hanan Samet ds0 DYNAMIC STORAGE ALLOCATION Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 07 e-mail: hjs@umiacs.umd.edu

More information

Shortest Paths for a Two-Robot Rendez-Vous

Shortest Paths for a Two-Robot Rendez-Vous Shotest Paths fo a Two-Robot Rendez-Vous Eik L Wyntes Joseph S B Mitchell y Abstact In this pape, we conside an optimal motion planning poblem fo a pai of point obots in a plana envionment with polygonal

More information

Point-Biserial Correlation Analysis of Fuzzy Attributes

Point-Biserial Correlation Analysis of Fuzzy Attributes Appl Math Inf Sci 6 No S pp 439S-444S (0 Applied Mathematics & Infomation Sciences An Intenational Jounal @ 0 NSP Natual Sciences Publishing o Point-iseial oelation Analysis of Fuzzy Attibutes Hao-En hueh

More information

a Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives

a Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives SPARK: Soot Reseach Kit Ondřej Lhoták Objectives Spak is a modula toolkit fo flow-insensitive may points-to analyses fo Java, which enables expeimentation with: vaious paametes of pointe analyses which

More information

Adaptation of TDMA Parameters Based on Network Conditions

Adaptation of TDMA Parameters Based on Network Conditions Adaptation of TDMA Paametes Based on Netwok Conditions Boa Kaaoglu Dept. of Elect. and Compute Eng. Univesity of Rocheste Rocheste, NY 14627 Email: kaaoglu@ece.ocheste.edu Tolga Numanoglu Dept. of Elect.

More information

An Optimised Density Based Clustering Algorithm

An Optimised Density Based Clustering Algorithm Intenational Jounal of Compute Applications (0975 8887) Volume 6 No.9, Septembe 010 An Optimised Density Based Clusteing Algoithm J. Hencil Pete Depatment of Compute Science St. Xavie s College, Palayamkottai,

More information

An Unsupervised Segmentation Framework For Texture Image Queries

An Unsupervised Segmentation Framework For Texture Image Queries An Unsupevised Segmentation Famewok Fo Textue Image Queies Shu-Ching Chen Distibuted Multimedia Infomation System Laboatoy School of Compute Science Floida Intenational Univesity Miami, FL 33199, USA chens@cs.fiu.edu

More information

Performance Optimization in Structured Wireless Sensor Networks

Performance Optimization in Structured Wireless Sensor Networks 5 The Intenational Aab Jounal of Infomation Technology, Vol. 6, o. 5, ovembe 9 Pefomance Optimization in Stuctued Wieless Senso etwoks Amine Moussa and Hoda Maalouf Compute Science Depatment, ote Dame

More information

Illumination methods for optical wear detection

Illumination methods for optical wear detection Illumination methods fo optical wea detection 1 J. Zhang, 2 P.P.L.Regtien 1 VIMEC Applied Vision Technology, Coy 43, 5653 LC Eindhoven, The Nethelands Email: jianbo.zhang@gmail.com 2 Faculty Electical

More information

where f(x, y): input image, g(x, y): processed image, and T: operator Or: s = T(r), where r: input pixel, and s: output pixel

where f(x, y): input image, g(x, y): processed image, and T: operator Or: s = T(r), where r: input pixel, and s: output pixel 3 Intenit Tanfomation and Spatial Filteing - Intenit tanfomation Change the intenit of each piel in ode to enhance the image: g, T[f, ], whee f, : input image, g, : poceed image, and T: opeato O: T, whee

More information

Characterizing Data Deliverability of Greedy Routing in Wireless Sensor Networks

Characterizing Data Deliverability of Greedy Routing in Wireless Sensor Networks Chaacteizing Data Deliveability of Geedy Routing in Wieless Senso Netwoks Jinwei Liu, Lei Yu, Haiying Shen, Yangyang He and Jason Hallstom Depatment of Electical and Compute Engineeing, Clemson Univesity,

More information

DYNAMIC STORAGE ALLOCATION. Hanan Samet

DYNAMIC STORAGE ALLOCATION. Hanan Samet ds0 DYNAMIC STORAGE ALLOCATION Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 074 e-mail: hjs@umiacs.umd.edu

More information

Information Retrieval. CS630 Representing and Accessing Digital Information. IR Basics. User Task. Basic IR Processes

Information Retrieval. CS630 Representing and Accessing Digital Information. IR Basics. User Task. Basic IR Processes CS630 Repesenting and Accessing Digital Infomation Infomation Retieval: Basics Thosten Joachims Conell Univesity Infomation Retieval Basics Retieval Models Indexing and Pepocessing Data Stuctues ~ 4 lectues

More information

Also available at ISSN (printed edn.), ISSN (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010)

Also available at  ISSN (printed edn.), ISSN (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010) Also available at http://amc.imfm.si ISSN 1855-3966 (pinted edn.), ISSN 1855-3974 (electonic edn.) ARS MATHEMATICA CONTEMPORANEA 3 (2010) 109 120 Fulleene patches I Jack E. Gave Syacuse Univesity, Depatment

More information

HISTOGRAMS are an important statistic reflecting the

HISTOGRAMS are an important statistic reflecting the JOURNAL OF L A T E X CLASS FILES, VOL. 14, NO. 8, AUGUST 2015 1 D 2 HistoSketch: Disciminative and Dynamic Similaity-Peseving Sketching of Steaming Histogams Dingqi Yang, Bin Li, Laua Rettig, and Philippe

More information

arxiv: v2 [physics.soc-ph] 30 Nov 2016

arxiv: v2 [physics.soc-ph] 30 Nov 2016 Tanspotation dynamics on coupled netwoks with limited bandwidth Ming Li 1,*, Mao-Bin Hu 1, and Bing-Hong Wang 2, axiv:1607.05382v2 [physics.soc-ph] 30 Nov 2016 1 School of Engineeing Science, Univesity

More information

4.2. Co-terminal and Related Angles. Investigate

4.2. Co-terminal and Related Angles. Investigate .2 Co-teminal and Related Angles Tigonometic atios can be used to model quantities such as

More information

ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM

ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM Luna M. Rodiguez*, Sue Ellen Haupt, and Geoge S. Young Depatment of Meteoology and Applied Reseach Laboatoy The Pennsylvania State Univesity,

More information

Lecture 27: Voronoi Diagrams

Lecture 27: Voronoi Diagrams We say that two points u, v Y ae in the same connected component of Y if thee is a path in R N fom u to v such that all the points along the path ae in the set Y. (Thee ae two connected components in the

More information

IEEE C802.16m-07/060. IEEE Broadband Wireless Access Working Group <http://ieee802.org/16>

IEEE C802.16m-07/060. IEEE Broadband Wireless Access Working Group <http://ieee802.org/16> 007-3-5 IEEE C80.6m-07/060 Poject Title Date Submitted IEEE 80.6 Boadband Wiele Acce Woking Goup Coelation Model fo Shadow Fading Simulation 007-3-5 Souce() I-Kang Fu, Chi-Fang Li,

More information

Monte Carlo Techniques for Rendering

Monte Carlo Techniques for Rendering Monte Calo Techniques fo Rendeing CS 517 Fall 2002 Compute Science Conell Univesity Announcements No ectue on Thusday Instead, attend Steven Gotle, Havad Upson Hall B17, 4:15-5:15 (efeshments ealie) Geomety

More information

PROBABILITY-BASED OPTIMAL PATH PLANNING FOR TWO-WHEELED MOBILE ROBOTS

PROBABILITY-BASED OPTIMAL PATH PLANNING FOR TWO-WHEELED MOBILE ROBOTS Poceedings of the ASME 215 Dynamic Systems and Contol Confeence DSCC215 Octobe 28-3, 215, Columbus, Ohio, USA DSCC215-999 PROBABILITY-BASED OPTIMAL PATH PLANNING FOR TWO-WHEELED MOBILE ROBOTS Jaeyeon Lee

More information

CS 450: COMPUTER GRAPHICS RASTERIZING CONICS SPRING 2016 DR. MICHAEL J. REALE

CS 450: COMPUTER GRAPHICS RASTERIZING CONICS SPRING 2016 DR. MICHAEL J. REALE CS 45: COMPUTER GRAPHICS RASTERIZING CONICS SPRING 6 DR. MICHAEL J. REALE RASTERIZING CURVES OTHER THAN LINES When dealing with othe inds of cuves, we can daw it in one of the following was: Use elicit

More information

Slotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System

Slotted Random Access Protocol with Dynamic Transmission Probability Control in CDMA System Slotted Random Access Potocol with Dynamic Tansmission Pobability Contol in CDMA System Intaek Lim 1 1 Depatment of Embedded Softwae, Busan Univesity of Foeign Studies, itlim@bufs.ac.k Abstact In packet

More information

Statistics of Images. Ioannis Rekleitis

Statistics of Images. Ioannis Rekleitis Statistics of Images Ioannis Rekleitis Some Basic Intensity Tansfoma2on Func2ons Thesholding Logistic function Log tansfomation Powe-law (Gamma coection) Piecewise-linea tansfomation Histogam pocessing

More information

Loss-Cognizant Pricing in Feed-Forward Networks with Greedy Users

Loss-Cognizant Pricing in Feed-Forward Networks with Greedy Users Loss-Cognizant Picing in Feed-Fowad Netwoks with Geedy Uses Ashaf Al Daoud and Muat Alanyali Depatment of Electical and Compute Engineeing Boston Univesity, Boston, MA 02215 Email: {ashaf, alanyali}@bu.edu

More information

A Recommender System for Online Personalization in the WUM Applications

A Recommender System for Online Personalization in the WUM Applications A Recommende System fo Online Pesonalization in the WUM Applications Mehdad Jalali 1, Nowati Mustapha 2, Ali Mamat 2, Md. Nasi B Sulaiman 2 Abstact foeseeing of use futue movements and intentions based

More information

Bo Gu and Xiaoyan Hong*

Bo Gu and Xiaoyan Hong* Int. J. Ad Hoc and Ubiquitous Computing, Vol. 11, Nos. /3, 1 169 Tansition phase of connectivity fo wieless netwoks with gowing pocess Bo Gu and Xiaoyan Hong* Depatment of Compute Science, Univesity of

More information

A Memory Efficient Array Architecture for Real-Time Motion Estimation

A Memory Efficient Array Architecture for Real-Time Motion Estimation A Memoy Efficient Aay Achitectue fo Real-Time Motion Estimation Vasily G. Moshnyaga and Keikichi Tamau Depatment of Electonics & Communication, Kyoto Univesity Sakyo-ku, Yoshida-Honmachi, Kyoto 66-1, JAPAN

More information

Class 21. N -body Techniques, Part 4

Class 21. N -body Techniques, Part 4 Class. N -body Techniques, Pat Tee Codes Efficiency can be inceased by gouping paticles togethe: Neaest paticles exet geatest foces diect summation. Distant paticles exet smallest foces teat in goups.

More information

Extensive games with imperfect information

Extensive games with imperfect information Extensive games with impefect infomation ECON500 Advanced micoeconomics ectues in game theoy Fall 0, Pat 3 7.07.0 G.. Asheim, ECON500-3 Incomplete Complete infomation infomation Pefect infomation Impefect

More information

TESSELLATIONS. This is a sample (draft) chapter from: MATHEMATICAL OUTPOURINGS. Newsletters and Musings from the St. Mark s Institute of Mathematics

TESSELLATIONS. This is a sample (draft) chapter from: MATHEMATICAL OUTPOURINGS. Newsletters and Musings from the St. Mark s Institute of Mathematics TESSELLATIONS This is a sample (daft) chapte fom: MATHEMATICAL OUTPOURINGS Newslettes and Musings fom the St. Mak s Institute of Mathematics James Tanton www.jamestanton.com This mateial was and can still

More information

Scaling Location-based Services with Dynamically Composed Location Index

Scaling Location-based Services with Dynamically Composed Location Index Scaling Location-based Sevices with Dynamically Composed Location Index Bhuvan Bamba, Sangeetha Seshadi and Ling Liu Distibuted Data Intensive Systems Laboatoy (DiSL) College of Computing, Geogia Institute

More information

Lecture 3: Rendering Equation

Lecture 3: Rendering Equation Lectue 3: Rendeing Equation CS 660, Sping 009 Kavita Bala Compute Science Conell Univesity Radiomety Radiomety: measuement of light enegy Defines elation between Powe Enegy Radiance Radiosity 1 Hemispheical

More information

THE THETA BLOCKCHAIN

THE THETA BLOCKCHAIN THE THETA BLOCKCHAIN Theta is a decentalized video steaming netwok, poweed by a new blockchain and token. By Theta Labs, Inc. Last Updated: Nov 21, 2017 esion 1.0 1 OUTLINE Motivation Reputation Dependent

More information

Generalized Grey Target Decision Method Based on Decision Makers Indifference Attribute Value Preferences

Generalized Grey Target Decision Method Based on Decision Makers Indifference Attribute Value Preferences Ameican Jounal of ata ining and Knowledge iscovey 27; 2(4): 2-8 http://www.sciencepublishinggoup.com//admkd doi:.648/.admkd.2724.2 Genealized Gey Taget ecision ethod Based on ecision akes Indiffeence Attibute

More information

Data mining based automated reverse engineering and defect discovery

Data mining based automated reverse engineering and defect discovery Data mining based automated evese engineeing and defect discovey James F. Smith III, ThanhVu H. Nguyen Naval Reseach Laboatoy, Code 5741, Washington, D.C., 20375-5000 ABSTRACT A data mining based pocedue

More information

Any modern computer system will incorporate (at least) two levels of storage:

Any modern computer system will incorporate (at least) two levels of storage: 1 Any moden compute system will incopoate (at least) two levels of stoage: pimay stoage: andom access memoy (RAM) typical capacity 32MB to 1GB cost pe MB $3. typical access time 5ns to 6ns bust tansfe

More information

MAT 1275: Introduction to Mathematical Analysis

MAT 1275: Introduction to Mathematical Analysis MAT 7: Intductin t Mathematical Analysis D A Rzenblyum Tignmetic Functins f Abitay Angles Unit Cicle In the pevius sectin we defined tig functins f acute angles: we cnstucted ight tiangle with given angle,

More information

A modal estimation based multitype sensor placement method

A modal estimation based multitype sensor placement method A modal estimation based multitype senso placement method *Xue-Yang Pei 1), Ting-Hua Yi 2) and Hong-Nan Li 3) 1),)2),3) School of Civil Engineeing, Dalian Univesity of Technology, Dalian 116023, China;

More information

Elastohydrodynamic Lubrication Analysis of Journal Bearings Using CAD

Elastohydrodynamic Lubrication Analysis of Journal Bearings Using CAD The 3d Intenational Confeence on Design Engineeing and Science, ICDES 1 Pilsen, Czech Repulic, August 31 Septeme 3, 1 Elastohydodynamic Luication Analysis of Jounal Beaings Using CAD Toshihio OZASA *1,

More information

Modelling, simulation, and performance analysis of a CAN FD system with SAE benchmark based message set

Modelling, simulation, and performance analysis of a CAN FD system with SAE benchmark based message set Modelling, simulation, and pefomance analysis of a CAN FD system with SAE benchmak based message set Mahmut Tenuh, Panagiotis Oikonomidis, Peiklis Chachalakis, Elias Stipidis Mugla S. K. Univesity, TR;

More information

Analysis of uniform illumination system with imperfect Lambertian LEDs

Analysis of uniform illumination system with imperfect Lambertian LEDs Optica Applicata, Vol. XLI, No. 3, 2011 Analysis of unifom illumination system with impefect Lambetian LEDs JIAJIE TAN 1, 2, KECHENG YANG 1*, MIN XIA 1, YING YANG 1 1 Wuhan National Laboatoy fo Optoelectonics,

More information

Optical Flow for Large Motion Using Gradient Technique

Optical Flow for Large Motion Using Gradient Technique SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 3, No. 1, June 2006, 103-113 Optical Flow fo Lage Motion Using Gadient Technique Md. Moshaof Hossain Sake 1, Kamal Bechkoum 2, K.K. Islam 1 Abstact: In this

More information

Pledge: Signature:

Pledge: Signature: S/PM 0 Final Exam 7 May 005 Name: KEY E-mail ID: @viginia.edu Pledge: Signatue: Thee ae 80 minutes 3 hous fo this exam and 80 oints on the test; don t send too long on any one uestion! Thee is an exam

More information

Prioritized Traffic Recovery over GMPLS Networks

Prioritized Traffic Recovery over GMPLS Networks Pioitized Taffic Recovey ove GMPLS Netwoks 2005 IEEE. Pesonal use of this mateial is pemitted. Pemission fom IEEE mu be obtained fo all othe uses in any cuent o futue media including epinting/epublishing

More information

Event-based Location Dependent Data Services in Mobile WSNs

Event-based Location Dependent Data Services in Mobile WSNs Event-based Location Dependent Data Sevices in Mobile WSNs Liang Hong 1, Yafeng Wu, Sang H. Son, Yansheng Lu 3 1 College of Compute Science and Technology, Wuhan Univesity, China Depatment of Compute Science,

More information

Physical simulation for animation

Physical simulation for animation Physical simulation fo animation Case study: The jello cube The Jello Cube Mass-Sping System Collision Detection Integatos Septembe 17 2002 1 Announcements Pogamming assignment 3 is out. It is due Tuesday,

More information

A Real-Time Foveated Senso with Ovelapping Receptive Fields Mac Bolduc and Matin D. Levine Cente fo Intelligent Machines McGill Univesity, 3480 Univesity St., Monteal, Quebec, Canada H3A 2A7 email: fbolduc,levineg@cim.mcgill.edu

More information

GTOC 9, Multiple Space Debris Rendezvous Trajectory Design in the J2 environment

GTOC 9, Multiple Space Debris Rendezvous Trajectory Design in the J2 environment GTOC 9, Multiple Space Debis Rendezvous Tajectoy Design in the J envionment Macus Hallmann, Makus Schlottee, Ansga Heidecke, Maco Sagliano Fedeico Fumenti, Volke Maiwald, René Schwaz Institute of Space

More information

ART GALLERIES WITH INTERIOR WALLS. March 1998

ART GALLERIES WITH INTERIOR WALLS. March 1998 ART GALLERIES WITH INTERIOR WALLS Andé Kündgen Mach 1998 Abstact. Conside an at galley fomed by a polygon on n vetices with m pais of vetices joined by inteio diagonals, the inteio walls. Each inteio wall

More information

An Energy-Efficient Approach for Provenance Transmission in Wireless Sensor Networks

An Energy-Efficient Approach for Provenance Transmission in Wireless Sensor Networks An Enegy-Efficient Appoach fo Povenance Tansmission in Wieless Senso Netwoks S. M. Iftekhaul Alam Pudue Univesity alams@pudue.edu Sonia Fahmy Pudue Univesity fahmy@cs.pudue.edu Abstact Assessing the tustwothiness

More information

GARBAGE COLLECTION METHODS. Hanan Samet

GARBAGE COLLECTION METHODS. Hanan Samet gc0 GARBAGE COLLECTION METHODS Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 07 e-mail: hjs@umiacs.umd.edu

More information

A Neural Network Model for Storing and Retrieving 2D Images of Rotated 3D Object Using Principal Components

A Neural Network Model for Storing and Retrieving 2D Images of Rotated 3D Object Using Principal Components A Neual Netwok Model fo Stong and Reteving 2D Images of Rotated 3D Object Using Pncipal Components Tsukasa AMANO, Shuichi KUROGI, Ayako EGUCHI, Takeshi NISHIDA, Yasuhio FUCHIKAWA Depatment of Contol Engineeng,

More information

Combinatorial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registration in Mobile IP Environments

Combinatorial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registration in Mobile IP Environments Wieless Netwoks 0, 3 32, 200 200 Kluwe Academic Publishes. Manufactued in The Nethelands. Combinatoial Mobile IP: A New Efficient Mobility Management Using Minimized Paging and Local Registation in Mobile

More information

Conversion Functions for Symmetric Key Ciphers

Conversion Functions for Symmetric Key Ciphers Jounal of Infomation Assuance and Secuity 2 (2006) 41 50 Convesion Functions fo Symmetic Key Ciphes Deba L. Cook and Angelos D. Keomytis Depatment of Compute Science Columbia Univesity, mail code 0401

More information

OPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO

OPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO OPTIMAL KINEMATIC SYNTHESIS OF CRANK & SLOTTED LEVER QUICK RETURN MECHANISM FOR SPECIFIC STROKE & TIME RATIO Zeeshan A. Shaikh 1 and T.Y. Badguja 2 1,2 Depatment of Mechanical Engineeing, Late G. N. Sapkal

More information

Dr. A.B.M. Toufique Hasan. Lecture-13

Dr. A.B.M. Toufique Hasan. Lecture-13 7/5/8 ME 45: Aeodynamics D. A.B.M. Toufique Hasan Pofesso Depatment of Mechanical Engineeing g Bangladesh Univesity of Engineeing & Technology BUET, Dhaka Lectue-3 7/5/8 Doublet & Flow Ove a stationey

More information

Number of Paths and Neighbours Effect on Multipath Routing in Mobile Ad Hoc Networks

Number of Paths and Neighbours Effect on Multipath Routing in Mobile Ad Hoc Networks Numbe of Paths and Neighbous Effect on Multipath Routing in Mobile Ad Hoc Netwoks Oday Jeew School of Infomation Systems and Accounting Univesity of Canbea Canbea ACT 2617, Austalia oday.jeew@canbea.edu.au

More information

Obstacle Avoidance of Autonomous Mobile Robot using Stereo Vision Sensor

Obstacle Avoidance of Autonomous Mobile Robot using Stereo Vision Sensor Obstacle Avoidance of Autonomous Mobile Robot using Steeo Vision Senso Masako Kumano Akihisa Ohya Shin ichi Yuta Intelligent Robot Laboatoy Univesity of Tsukuba, Ibaaki, 35-8573 Japan E-mail: {masako,

More information

Efficient Execution Path Exploration for Detecting Races in Concurrent Programs

Efficient Execution Path Exploration for Detecting Races in Concurrent Programs IAENG Intenational Jounal of Compute Science, 403, IJCS_40_3_02 Efficient Execution Path Exploation fo Detecting Races in Concuent Pogams Theodous E. Setiadi, Akihiko Ohsuga, and Mamou Maekaa Abstact Concuent

More information

CSE 165: 3D User Interaction

CSE 165: 3D User Interaction CSE 165: 3D Use Inteaction Lectue #6: Selection Instucto: Jugen Schulze, Ph.D. 2 Announcements Homewok Assignment #2 Due Fiday, Januay 23 d at 1:00pm 3 4 Selection and Manipulation 5 Why ae Selection and

More information

Frequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters

Frequency Domain Approach for Face Recognition Using Optical Vanderlugt Filters Optics and Photonics Jounal, 016, 6, 94-100 Published Online August 016 in SciRes. http://www.scip.og/jounal/opj http://dx.doi.og/10.436/opj.016.68b016 Fequency Domain Appoach fo Face Recognition Using

More information

On Error Estimation in Runge-Kutta Methods

On Error Estimation in Runge-Kutta Methods Leonado Jounal of Sciences ISSN 1583-0233 Issue 18, Januay-June 2011 p. 1-10 On Eo Estimation in Runge-Kutta Methods Ochoche ABRAHAM 1,*, Gbolahan BOLARIN 2 1 Depatment of Infomation Technology, 2 Depatment

More information

Lecture Topics ECE 341. Lecture # 12. Control Signals. Control Signals for Datapath. Basic Processing Unit. Pipelining

Lecture Topics ECE 341. Lecture # 12. Control Signals. Control Signals for Datapath. Basic Processing Unit. Pipelining EE 341 Lectue # 12 Instucto: Zeshan hishti zeshan@ece.pdx.edu Novembe 10, 2014 Potland State Univesity asic Pocessing Unit ontol Signals Hadwied ontol Datapath contol signals Dealing with memoy delay Pipelining

More information

ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS

ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS ANALYTIC PERFORMANCE MODELS FOR SINGLE CLASS AND MULTIPLE CLASS MULTITHREADED SOFTWARE SERVERS Daniel A Menascé Mohamed N Bennani Dept of Compute Science Oacle, Inc Geoge Mason Univesity 1211 SW Fifth

More information

Erasure-Coding Based Routing for Opportunistic Networks

Erasure-Coding Based Routing for Opportunistic Networks Easue-Coding Based Routing fo Oppotunistic Netwoks Yong Wang, Sushant Jain, Magaet Matonosi, Kevin Fall Pinceton Univesity, Univesity of Washington, Intel Reseach Bekeley ABSTRACT Routing in Delay Toleant

More information

Query Language #1/3: Relational Algebra Pure, Procedural, and Set-oriented

Query Language #1/3: Relational Algebra Pure, Procedural, and Set-oriented Quey Language #1/3: Relational Algeba Pue, Pocedual, and Set-oiented To expess a quey, we use a set of opeations. Each opeation takes one o moe elations as input paamete (set-oiented). Since each opeation

More information

! PROBLEM Statement: Given: Link lengths: r 4. in l 15. Piston bore: B 3. in Peak pressure: p g 600. psi Crank angle: θ 5.

! PROBLEM Statement: Given: Link lengths: r 4. in l 15. Piston bore: B 3. in Peak pressure: p g 600. psi Crank angle: θ 5. DESIGN OF MACHINERY SOLUTION MANUAL 13-4-1! PROBLEM 13-4 A side-cank inkage has the dimensions given beow. The peak gas pessue and cank ange ae aso given. Cacuate the gas foce and gas toque at this position.

More information