CSE 272 Assignment 1

Size: px
Start display at page:

Download "CSE 272 Assignment 1"

Transcription

1 CSE 7 Assignmnt 1 Kui-Chun Hsu Task 1: Comput th irradianc at A analytically (point light) For point light, first th nrgy rachd A was calculatd, thn th nrgy was rducd by a factor according to th angl btwn A s surfac normal and th light incidnt dirction. Φ Φ E= cosθ = cosθ da 4πr 50 (5,5,0) (0,1,0) 50 5 = = 4π (5,5,0) (0,0,0) (5,5,0) (0,1,0) 4π = Task : Comput th irradianc at A using progrssiv photon mapping (point light) Th point light tst scn was valuatd with th progrssiv photon mapping, with initial configuration radius R = 0. 7, alphaα = 0. 5, and photons mittd pr i itration K = In ach itration, th irradianc, radius ( R i ), and local photon count ( N ) wr valuatd. Aftr 100 million photons ar mittd, th thr valus i convrgd to , , and rspctivly. To gt an ovrall undrstanding of th convrgnc procss during progrssiv photon mapping, th thr valus wr also plottd as a function of mittd photons as follows: Irradianc at A Irradianc (W/(m*m)) Numbr of photons ( photons)

2 Maximum irradianc stimatd: 1647 at itration 5 Minimum irradianc stimatd: at itration 18 Radius Ri Numbr of photons ( photons) Local Photon Count Ni Numbr of photons ( photons)

3 Hackr points 1: Comput th irradianc at A analytically (squar light) 1. First th radianc mittanc (M) of th point light is calculatd: M = L θdω = cos Ω 0 M Φ L = = π πa π π 0 L cosθ sinθdθdϕ = πl. Th irradianc is thn computd by plugging in L : E = = Ω A ( ω' n') da L ( ω n) = L r L cosθdω = A cosθ ' da L cosθ r x y ( x y + y + z ) dxdy Evaluat th intgral with Matlab w gt E = Task 3: Comput th irradianc at A using progrssiv photon mapping (squar light) Th squar light tst scn was valuatd with th sam initial configuration as in Task. Aftr 100 million photons ar mittd, th thr valus convrgd to , , and rspctivly. Th valus of irradianc, radius, and local photon count during th progrssiv photon mapping wr also plottd: Irradianc at A Irradianc (W/(m*m)) Numbr of photons ( photons) Maximum irradianc stimatd: at itration 4 Minimum irradianc stimatd: 5999 at itration 106

4 Radius Ri Numbr of photons ( photons) Local Photon Count Ni Numbr of photons ( photons) Task 4: Bst initial configuration for radius (R), mittd photons pr itration (K), and α Th objct for this task is to achiv accurat irradianc stimation within 10 million photons mittd. In othr words, it is to find a configuration to achiv fast and accurat convrgnc. Whn th nw itration has littl contribution to th accumulatd flux, th irradianc is said to b convrgd. Th contribution is from th nw photons within th radius, which is α M. If w assum all photons ar mittd vnly in all dirctions, and th tst scn is simpl nough that no objcts ar occludd by othrs, thn a masur point has α M = K ω α nw photons in ach itration, whr ω is th solid angl of th masurd ara of th masur point. A trivial configuration to achiv fast convrgnc is to mak th thr componnts in M small, but it is asy to convrg to incorrct rsults if thy ar too small. Th tradoffs ar listd as blow:

5 Paramtrs Too larg Too small R ( ω ) 1. Tak too many far- Can t gt nough nw photons (low away photons into possibility of photon hits within th radius) flux valuation. convrg slowly K 1. convrg slowly Can t gt nough nw photons α 1. wast rsourcs. convrg slowly Estimatd ara of th first itration Th scond itration If α is too small, thn R shrinks fast. For simplicity, assum w convrg at th scond itration, as th figur shown abov, thn as w can s th two masurd ara hav a dramatic diffrnc; th blu ara covrs lots of far-away photons. Howvr, th contribution of th photons in both itration hav th sam wight in accumulatd flux, which mans at last half of th contribution coms from th far-away photons, and this lads to inaccurat convrgnc. To sarch for th bst configuration, two assumptions wr mad: 1. Assum th sarch won t fall into local minimum in th givn sarch rang. Onc a local minimum of th rror is rachd, th rsult configuration is th bst on.. Assum th thr paramtrs ar indpndnt with ach othr; thrfor th paramtrs can b sarchd on at a tim, whil all othr paramtrs stay fixd. Basd on th assumptions, a binary sarch was prformd to sarch for th bst configuration. Sinc α M = K ω α indicats th smallr paramtrs givs fastr convrgnc, th basic ida was to start with stting ach paramtr to a sufficintly larg numbr, and thn dcrasing it whn th smallr valu givs th bst accuracy so far, or incrasing it othrwis. Th sarchs for R and α stop whn a local

6 minimum is rachd. Th stop critrion for sarching K is a littl diffrnt sinc th rror is always small with largr K. Th sarch for K stops whn largr K givs no contribution to rduc th rror. K is also th last paramtr to b sarchd; aftr R and α ar dtrmind, th sarch for K is startd. Th rsult configuration and rror wr listd blow: Initial valu Point light Bst configuration Squar light R ( ω ) R = 1.00, α =0.90, K= K R = bst, α = bst, K= α R = bst, α =0.90, K= rror Th abov sarch startd from R, α, and thn K. Th bst mans th initial valus for th sarch ar changd to th bst configuration so far. Howvr, unfortunatly local minimum problm did occur. For th initial sarch valu abov, th bst K for point light should b 50000, which only gav rror = and usd half as much mmory as K=96777 did. Morovr, an intrsting obsrvation was th small K gav rasonably good rsult. For xampl (R = bst, α =bst, K=10000) gav rror quals to for squar light.

8.3 INTEGRATION BY PARTS

8.3 INTEGRATION BY PARTS 8.3 Intgration By Parts Contmporary Calculus 8.3 INTEGRATION BY PARTS Intgration by parts is an intgration mthod which nabls us to find antidrivativs of som nw functions such as ln(x) and arctan(x) as

More information

TCP Congestion Control. Congestion Avoidance

TCP Congestion Control. Congestion Avoidance TCP Congstion Control TCP sourcs chang th snding rat by modifying th window siz: Window = min {Advrtisd window, Congstion Window} Rcivr Transmittr ( cwnd ) In othr words, snd at th rat of th slowst componnt:

More information

Midterm 2 - Solutions 1

Midterm 2 - Solutions 1 COS 26 Gnral Computr Scinc Spring 999 Midtrm 2 - Solutions. Writ a C function int count(char s[ ]) that taks as input a \ trminatd string and outputs th numbr of charactrs in th string (not including th

More information

DO NOW Geometry Regents Lomac Date. due. Similar by Transformation 6.1 J'' J''' J'''

DO NOW Geometry Regents Lomac Date. due. Similar by Transformation 6.1 J'' J''' J''' DO NOW Gomtry Rgnts Lomac 2014-2015 Dat. du. Similar by Transformation 6.1 (DN) Nam th thr rigid transformations and sktch an xampl that illustrats ach on. Nam Pr LO: I can dscrib a similarity transformation,

More information

Terrain Mapping and Analysis

Terrain Mapping and Analysis Trrain Mapping and Analysis Data for Trrain Mapping and Analysis Digital Trrain Modl (DEM) DEM rprsnts an array of lvation points. Th quality of DEM influncs th accuracy of trrain masurs such as slop and

More information

Systems in Three Variables. No solution No point lies in all three planes. One solution The planes intersect at one point.

Systems in Three Variables. No solution No point lies in all three planes. One solution The planes intersect at one point. 3-5 Systms in Thr Variabls TEKS FOCUS VOCABULARY TEKS (3)(B) Solv systms of thr linar quations in thr variabls by using Gaussian limination, tchnology with matrics, and substitution. Rprsntation a way

More information

: Mesh Processing. Chapter 6

: Mesh Processing. Chapter 6 600.657: Msh Procssing Chaptr 6 Quad-Dominant Rmshing Goal: Gnrat a rmshing of th surfac that consists mostly of quads whos dgs align with th principal curvatur dirctions. [Marinov t al. 04] [Alliz t al.

More information

Problem Set 1 (Due: Friday, Sept. 29, 2017)

Problem Set 1 (Due: Friday, Sept. 29, 2017) Elctrical and Computr Enginring Mmorial Univrsity of Nwfoundland ENGI 9876 - Advancd Data Ntworks Fall 2017 Problm St 1 (Du: Friday, Spt. 29, 2017) Qustion 1 Considr a communications path through a packt

More information

" dx v(x) $ % You may also have seen this written in shorthand form as. & ' v(x) + u(x) '# % ! d

 dx v(x) $ % You may also have seen this written in shorthand form as. & ' v(x) + u(x) '# % ! d Calculus II MAT 146 Mthods of Intgration: Intgration by Parts Just as th mthod of substitution is an intgration tchniqu that rvrss th drivativ procss calld th chain rul, Intgration by parts is a mthod

More information

The Size of the 3D Visibility Skeleton: Analysis and Application

The Size of the 3D Visibility Skeleton: Analysis and Application Th Siz of th 3D Visibility Sklton: Analysis and Application Ph.D. thsis proposal Linqiao Zhang lzhang15@cs.mcgill.ca School of Computr Scinc, McGill Univrsity March 20, 2008 thsis proposal: Th Siz of th

More information

Maxwell s unification: From Last Time. Energy of light. Modern Physics. Unusual experimental results. The photoelectric effect

Maxwell s unification: From Last Time. Energy of light. Modern Physics. Unusual experimental results. The photoelectric effect From Last Tim Enrgy and powr in an EM wav Maxwll s unification: 1873 Intimat connction btwn lctricity and magntism Exprimntally vrifid by Hlmholtz and othrs, 1888 Polarization of an EM wav: oscillation

More information

1. Trace the array for Bubble sort 34, 8, 64, 51, 32, 21. And fill in the following table

1. Trace the array for Bubble sort 34, 8, 64, 51, 32, 21. And fill in the following table 1. Trac th array for Bubbl sort 34, 8, 64, 51, 3, 1. And fill in th following tabl bubbl(intgr Array x, Intgr n) Stp 1: Intgr hold, j, pass; Stp : Boolan switchd = TRUE; Stp 3: for pass = 0 to (n - 1 &&

More information

Installation Saving. Enhanced Physical Durability Enhanced Performance Warranty The IRR Comparison

Installation Saving. Enhanced Physical Durability Enhanced Performance Warranty The IRR Comparison Contnts Tchnology Nwly Dvlopd Cllo Tchnology Cllo Tchnology : Improvd Absorption of Light Doubl-sidd Cll Structur Cllo Tchnology : Lss Powr Gnration Loss Extrmly Low LID Clls 3 3 4 4 4 Advantag Installation

More information

The Network Layer: Routing Algorithms. The Network Layer: Routing & Addressing Outline

The Network Layer: Routing Algorithms. The Network Layer: Routing & Addressing Outline PS 6 Ntwork Programming Th Ntwork Layr: Routing lgorithms Michl Wigl partmnt of omputr Scinc lmson Univrsity mwigl@cs.clmson.du http://www.cs.clmson.du/~mwigl/courss/cpsc6 Th Ntwork Layr: Routing & ddrssing

More information

CPSC 826 Internetworking. The Network Layer: Routing & Addressing Outline. The Network Layer: Routing Algorithms. Routing Algorithms Taxonomy

CPSC 826 Internetworking. The Network Layer: Routing & Addressing Outline. The Network Layer: Routing Algorithms. Routing Algorithms Taxonomy PS Intrntworking Th Ntwork Layr: Routing & ddrssing Outlin Th Ntwork Layr: Routing lgorithms Michl Wigl partmnt of omputr Scinc lmson Univrsity mwigl@cs.clmson.du Novmbr, Ntwork layr functions Routr architctur

More information

Clustering Algorithms

Clustering Algorithms Clustring Algoritms Hirarcical Clustring k -Mans Algoritms CURE Algoritm 1 Mtods of Clustring Hirarcical (Agglomrativ): Initially, ac point in clustr by itslf. Rpatdly combin t two narst clustrs into on.

More information

Vignette to package samplingdatacrt

Vignette to package samplingdatacrt Vigntt to packag samplingdatacrt Diana Trutschl Contnts 1 Introduction 1 11 Objctiv 1 1 Diffrnt study typs 1 Multivariat normal distributd data for multilvl data 1 Fixd ffcts part Random part 9 3 Manual

More information

Probabilistic inference

Probabilistic inference robabilistic infrnc Suppos th agnt has to mak a dcision about th valu of an unobsrvd qury variabl X givn som obsrvd vidnc E = artially obsrvabl, stochastic, pisodic nvironmnt Eampls: X = {spam, not spam},

More information

A Brief Summary of Draw Tools in MS Word with Examples! ( Page 1 )

A Brief Summary of Draw Tools in MS Word with Examples! ( Page 1 ) A Brif Summary of Draw Tools in MS Word with Exampls! ( Pag 1 ) Click Viw command at top of pag thn Click Toolbars thn Click Drawing! A chckmark appars in front of Drawing! A toolbar appars at bottom of

More information

arxiv: v1 [cs.cv] 7 Aug 2017

arxiv: v1 [cs.cv] 7 Aug 2017 Larning for Activ 3D Mapping arl Zimmrmann, Tomáš Ptříčk, Vojtěch Šalanský, and Tomáš Svoboda Czch Tchnical Univrsity in Pragu, Faculty of Elctrical Enginring zimmrk@fl.cvut.cz arxiv:708.02074v [cs.cv]

More information

Greedy Algorithms. Interval Scheduling. Greedy Algorithm. Optimality. Greedy Algorithm (cntd) Greed is good. Greed is right. Greed works.

Greedy Algorithms. Interval Scheduling. Greedy Algorithm. Optimality. Greedy Algorithm (cntd) Greed is good. Greed is right. Greed works. Algorithm Grdy Algorithm 5- Grdy Algorithm Grd i good. Grd i right. Grd work. Wall Strt Data Structur and Algorithm Andri Bulatov Algorithm Grdy Algorithm 5- Algorithm Grdy Algorithm 5- Intrval Schduling

More information

Register Allocation. Register Allocation

Register Allocation. Register Allocation Rgistr Allocation Jingk Li Portlan Stat Univrsity Jingk Li (Portlan Stat Univrsity) CS322 Rgistr Allocation 1 / 28 Rgistr Allocation Assign an unboun numbr of tmporaris to a fix numbr of rgistrs. Exampl:

More information

SPECKLE NOISE REDUCTION IN SAR IMAGING USING 2-D LATTICE FILTERS BASED SUBBAND DECOMPOSITION

SPECKLE NOISE REDUCTION IN SAR IMAGING USING 2-D LATTICE FILTERS BASED SUBBAND DECOMPOSITION 7th Europan Signal Procssing Confrnc EUSIPCO 9 Glasgow Scotland August 4-8 9 SPECKLE REDUCTION IN SAR IMAGING USING -D LATTICE FILTERS ASED SUAND DECOMPOSITION Göhan Karasaal N.. Kaplan I. Err Informatics

More information

Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, Directed Graphs BOS SFO

Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, Directed Graphs BOS SFO Prsntation for us with th txtbook, Algorithm Dsign and Applications, by M. T. Goodrich and R. Tamassia, Wily, 2015 Dirctd Graphs BOS ORD JFK SFO LAX DFW MIA 2015 Goodrich and Tamassia Dirctd Graphs 1 Digraphs

More information

To Do. Mesh Data Structures. Mesh Data Structures. Motivation. Outline. Advanced Computer Graphics (Fall 2010) Desirable Characteristics 1

To Do. Mesh Data Structures. Mesh Data Structures. Motivation. Outline. Advanced Computer Graphics (Fall 2010) Desirable Characteristics 1 Advancd Computr Graphics (Fall 200) CS 283, Lctur 5: Msh Data Structurs Ravi Ramamoorthi http://inst.cs.brkly.du/~cs283/fa0 To Do Assignmnt, Du Oct 7. Start rading and working on it now. Som parts you

More information

2 Mega Pixel. HD-SDI Bullet Camera. User Manual

2 Mega Pixel. HD-SDI Bullet Camera. User Manual 2 Mga Pixl HD-SDI Bullt Camra Usr Manual Thank you for purchasing our product. This manual is only applicabl to SDI bullt camras. Thr may b svral tchnically incorrct placs or printing rrors in this manual.

More information

From Last Time. Origin of Malus law. Circular and elliptical polarization. Energy of light. The photoelectric effect. Exam 3 is Tuesday Nov.

From Last Time. Origin of Malus law. Circular and elliptical polarization. Energy of light. The photoelectric effect. Exam 3 is Tuesday Nov. From Last Tim Enrgy and powr in an EM wav Exam 3 is Tusday Nov. 25 5:30-7 pm, 2103 Ch (hr) Studnts w / schduld acadmic conflict plas stay aftr class Tus. Nov. 18 to arrang altrnat tim. Covrs: all matrial

More information

Efficient Obstacle-Avoiding Rectilinear Steiner Tree Construction

Efficient Obstacle-Avoiding Rectilinear Steiner Tree Construction Efficint Obstacl-Avoiding Rctilinar Stinr Tr Construction Chung-Wi Lin, Szu-Yu Chn, Chi-Fng Li, Yao-Wn Chang, and Chia-Lin Yang Graduat Institut of Elctronics Enginring Dpartmnt of Elctrical Enginring

More information

Shift. Reduce. Review: Shift-Reduce Parsing. Bottom-up parsing uses two actions: Bottom-Up Parsing II. ABC xyz ABCx yz. Lecture 8.

Shift. Reduce. Review: Shift-Reduce Parsing. Bottom-up parsing uses two actions: Bottom-Up Parsing II. ABC xyz ABCx yz. Lecture 8. Rviw: Shift-Rduc Parsing Bottom-up parsing uss two actions: Bottom-Up Parsing II Lctur 8 Shift ABC xyz ABCx yz Rduc Cbxy ijk CbA ijk Prof. Aikn CS 13 Lctur 8 1 Prof. Aikn CS 13 Lctur 8 2 Rcall: h Stack

More information

CC-RANSAC: Fitting Planes in the Presence of Multiple Surfaces in Range Data

CC-RANSAC: Fitting Planes in the Presence of Multiple Surfaces in Range Data CC-RANSAC: Fitting Plans in th Prsnc of Multipl Surfacs in Rang Data Orazio Gallo, Robrto Manduchi Univrsity of California, Santa Cruz Abbas Rafii Cansta, Inc. Abstract Rang snsors, in particular tim-of-flight

More information

Spectral sensitivity and color formats

Spectral sensitivity and color formats FirWir camras Spctral snsitivity and color formats At th "input" of a camra, w hav a CCD chip. It transforms photons into lctrons. Th spctral snsitivity of this transformation is an important charactristic

More information

To Do. Advanced Computer Graphics. Motivation. Mesh Data Structures. Outline. Mesh Data Structures. Desirable Characteristics 1

To Do. Advanced Computer Graphics. Motivation. Mesh Data Structures. Outline. Mesh Data Structures. Desirable Characteristics 1 Advancd Computr Graphics CSE 63 [Spring 207], Lctur 7 Ravi Ramamoorthi http://www.cs.ucsd.du/~ravir To Do Assignmnt, Du Apr 28 Any last minut issus or difficultis? Starting Gomtry Procssing Assignmnt 2

More information

A New Algorithm for Solving Shortest Path Problem on a Network with Imprecise Edge Weight

A New Algorithm for Solving Shortest Path Problem on a Network with Imprecise Edge Weight Availabl at http://pvamudu/aam Appl Appl Math ISSN: 193-9466 Vol 6, Issu (Dcmbr 011), pp 60 619 Applications and Applid Mathmatics: An Intrnational Journal (AAM) A Nw Algorithm for Solving Shortst Path

More information

To Do. Advanced Computer Graphics. Motivation. Mesh Data Structures. Outline. Mesh Data Structures. Desirable Characteristics 1

To Do. Advanced Computer Graphics. Motivation. Mesh Data Structures. Outline. Mesh Data Structures. Desirable Characteristics 1 Advancd Computr Graphics CSE 63 [Spring 208], Lctur 7 Ravi Ramamoorthi http://www.cs.ucsd.du/~ravir To Do Assignmnt, Du Apr 27 Any last minut issus or difficultis? Starting Gomtry Procssing Assignmnt 2

More information

Analysis of Influence AS Path Prepending to the Instability of BGP Routing Protocol.

Analysis of Influence AS Path Prepending to the Instability of BGP Routing Protocol. ISSN : 2355-9365 -Procding of Enginring : Vol.5, No.1 Mart 2018 Pag 1112 Analysis of Influnc AS Path Prpnding to th Instability of BGP Routing Protocol. Hirwandi Agusnam 1, Rndy Munadi 2, Istikmal 3 1,2,3,

More information

Dynamic modelling of multi-physical domain system by bond graph approach and its control using flatness based controller with MATLAB Simulink

Dynamic modelling of multi-physical domain system by bond graph approach and its control using flatness based controller with MATLAB Simulink Dnamic modlling of multi-phsical domain sstm b bond graph approach and its control using flatnss basd controllr with MATLAB Simulink Sauma Ranjan Sahoo Rsarch Scholar Robotics Lab Dr. Shital S. Chiddarwar

More information

Misbehavior in Nash Bargaining Solution Allocation

Misbehavior in Nash Bargaining Solution Allocation Misbhavior in Nash Bargaining Solution Allocation Ilya Nikolavskiy, Andry Lukyannko, Andri Gurtov Aalto Univrsity, Finland, firstnam.lastnam@aalto.fi Hlsinki Institut for Information Tchnology, Finland,

More information

Workbook for Designing Distributed Control Applications using Rockwell Automation s HOLOBLOC Prototyping Software John Fischer and Thomas O.

Workbook for Designing Distributed Control Applications using Rockwell Automation s HOLOBLOC Prototyping Software John Fischer and Thomas O. Workbook for Dsigning Distributd Control Applications using Rockwll Automation s HOLOBLOC Prototyping Softwar John Fischr and Thomas O. Bouchr Working Papr No. 05-017 Introduction A nw paradigm for crating

More information

TRIANGULATION OF NURBS SURFACES. Jamshid Samareh-Abolhassani. 1 Abstract

TRIANGULATION OF NURBS SURFACES. Jamshid Samareh-Abolhassani. 1 Abstract TRIANGULATION OF NURBS SURFACES Jamshid Samarh-Abolhassani 1 Abstract A tchniqu is prsntd for triangulation of NURBS surfacs. This tchniqu is built upon an advancing front tchniqu combind with grid point

More information

Parser Self-Training for Syntax-Based Machine Translation

Parser Self-Training for Syntax-Based Machine Translation arsr Slf-Training for Syntax-Basd Machin Translation Makoto Morishita, Koichi Akab, Yuto Hatakoshi Graham ubig, Koichiro Yoshino, Satoshi akamrua Graduat School of Information Scinc ara Institut of Scinc

More information

An Agent-Based Architecture for Service Discovery and Negotiation in Wireless Networks

An Agent-Based Architecture for Service Discovery and Negotiation in Wireless Networks An Agnt-Basd Architctur for Srvic Discovry and Ngotiation in Wirlss Ntworks Abstract Erich Birchr and Torstn Braun Univrsity of Brn, Nubrückstrass 10, 3012 Brn, Switzrland Email: braun@iam.unib.ch This

More information

2018 How to Apply. Application Guide. BrandAdvantage

2018 How to Apply. Application Guide. BrandAdvantage 2018 How to Apply Application Guid BrandAdvantag Contnts Accssing th Grant Sit... 3 Wlcom pag... 3 Logging in To Pub Charity... 4 Rgistration for Nw Applicants ( rgistr now )... 5 Organisation Rgistration...

More information

Type & Media Page 1. January 2014 Libby Clarke

Type & Media Page 1. January 2014 Libby Clarke Nam: 1 In ordr to hlp you s your progrss at th nd of this ntir xrcis, you nd to provid som vidnc of your starting point. To start, draw th a on th lft into th box to th right, dpicting th sam siz and placmnt.

More information

An Auto-tuned Method for Solving Large Tridiagonal Systems on the GPU

An Auto-tuned Method for Solving Large Tridiagonal Systems on the GPU An Auto-tund Mthod for Solving Larg Tridiagonal Systms on th GPU Andrw Davidson Univrsity of California, Davis aaldavidson@ucdavis.du Yao Zhang Univrsity of California, Davis yaozhang@ucdavis.du John D.

More information

EE 231 Fall EE 231 Homework 10 Due November 5, 2010

EE 231 Fall EE 231 Homework 10 Due November 5, 2010 EE 23 Fall 2 EE 23 Homwork Du Novmbr 5, 2. Dsign a synhronous squntial iruit whih gnrats th following squn. (Th squn should rpat itslf.) (a) Draw a stat transition diagram for th iruit. This is a systm

More information

Summary: Semantic Analysis

Summary: Semantic Analysis Summary: Smantic Analysis Chck rrors not dtctd by lxical or syntax analysis Intrmdiat Cod Scop rrors: Variabls not dfind Multipl dclarations Typ rrors: Assignmnt of valus of diffrnt typs Invocation of

More information

Comparing dose in the build-up region between compensator- and MLC-based IMRT

Comparing dose in the build-up region between compensator- and MLC-based IMRT JOURAL OF APPLIED CLIICAL MEDICAL PHYSICS, VOLUME 13, UMBER 5, 2012 Comparing dos in th build-up rgion btwn compnsator- and MLC-basd IMRT Khosrow Javdan, 1,2 Goffry G. Zhang, 1a Sarah Hoff, 1 Vladimir

More information

Intersection-free Dual Contouring on Uniform Grids: An Approach Based on Convex/Concave Analysis

Intersection-free Dual Contouring on Uniform Grids: An Approach Based on Convex/Concave Analysis Intrsction-fr Dual Contouring on Uniform Grids: An Approach Basd on Convx/Concav Analysis Charli C. L. Wang Dpartmnt of Mchanical and Automation Enginring, Th Chins Univrsity of Hong Kong E-mail: cwang@ma.cuhk.du.hk

More information

FLASHING CHRISTMAS TREE KIT

FLASHING CHRISTMAS TREE KIT R4 FLASHING CHRISTMAS TREE KIT 9 10 8 7 11 6 R3 12 T4 C4 5 T3 R5 R7 13 C3 C2 4 14 R1 T2 R6 3 OWNER S MANUAL T1 R8 15 2 C1 R2 1 16 Cat. No. 277-8001 CUSTOM MANUFACTURED FOR TANDY CORPORATION LTD ASSEMBLY

More information

Managing Trust Relationships in Peer 2 Peer Systems

Managing Trust Relationships in Peer 2 Peer Systems Managing Trust Rlationships in Pr 2 Pr Systms R.S.SINJU PG STUDENT, DEPARTMENT OF COMPUTER SCIENCE, PONJESLY COLLEGE OF ENGINEERING NAGERCOIL, TAMILNADU, INDIA C.FELSY ASST.PROF, DEPARTMENT OF COMPUTER

More information

Announcements. q This week s schedule. q Next week. q Grading. n Wednesday holiday. n Thursday class from am

Announcements. q This week s schedule. q Next week. q Grading. n Wednesday holiday. n Thursday class from am Announcmnts This wk s schdul n Wdnsday holiday n Thursday class from 9.00-0.30am Nxt wk n Monday and Tusday rgular class n Wdnsday Last uiz for th cours Grading n Quiz 5, 6 and Lab 6 ar du. Applications

More information

Evolutionary Clustering and Analysis of Bibliographic Networks

Evolutionary Clustering and Analysis of Bibliographic Networks Evolutionary Clustring and Analysis of Bibliographic Ntworks Manish Gupta Univrsity of Illinois at Urbana-Champaign gupta58@illinois.du Charu C. Aggarwal IBM T. J. Watson Rsarch Cntr charu@us.ibm.com Jiawi

More information

Introduction to Data Mining

Introduction to Data Mining Introduction to Data Mining Lctur #15: Clustring-2 Soul National Univrsity 1 In Tis Lctur Larn t motivation and advantag of BFR, an xtnsion of K-mans to vry larg data Larn t motivation and advantag of

More information

A Vision-based Navigation System of Mobile Tracking Robot

A Vision-based Navigation System of Mobile Tracking Robot A Vision-basd Navigation Systm of Mobil Tracking Robot Ji Wu Vac1av Snasl Dpt. Computr Scinc FCS VSB - Tchnical Univrsity of Ostrava Ostrava Czch Rpublic dfrmat2008 @hotmail.com vaclav. snasl @vsb.cz Ajith

More information

Multihop MIMO Relay Networks with ARQ

Multihop MIMO Relay Networks with ARQ Multihop MIMO Rlay Ntworks with ARQ Yao Xi Dniz Gündüz Andra Goldsmith Dpartmnt of Elctrical Enginring Stanford Univrsity Stanford CA Dpartmnt of Elctrical Enginring Princton Univrsity Princton NJ Email:

More information

The Design and Evaluation of a Scalable Wireless MAC Protocol

The Design and Evaluation of a Scalable Wireless MAC Protocol Th Dsign and Evaluation of a Scalabl Wirlss MAC Protocol Tchnical Rport UIUCDCS-R--793 Chun-chng Chn, Eunsoo So, and Haiyun Luo Dpt. of Computr Scinc Univ. of Illinois at Urbana-Champaign Urbana, IL 181-3

More information

On Some Maximum Area Problems I

On Some Maximum Area Problems I On Som Maximum Ara Problms I 1. Introdution Whn th lngths of th thr sids of a triangl ar givn as I 1, I and I 3, thn its ara A is uniquly dtrmind, and A=s(s-I 1 )(s-i )(s-i 3 ), whr sis th smi-primtr t{i

More information

Gernot Hoffmann Sphere Tessellation by Icosahedron Subdivision. Contents

Gernot Hoffmann Sphere Tessellation by Icosahedron Subdivision. Contents Grnot Hoffmann Sphr Tssllation by Icosahdron Subdivision Contnts 1. Vrtx Coordinats. Edg Subdivision 3 3. Triangl Subdivision 4 4. Edg lngths 5 5. Normal Vctors 6 6. Subdividd Icosahdrons 7 7. Txtur Mapping

More information

Clustering Algorithms

Clustering Algorithms Clustring Algoritms Applications Hirarcical Clustring k -Mans Algoritms CURE Algoritm 1 T Problm of Clustring Givn a st of points, wit a notion of distanc btwn points, group t points into som numbr of

More information

Internet Technology 3/21/2016

Internet Technology 3/21/2016 Intrnt Tchnolog //6 Roting algorithm goal st hop rotr = sorc rotr last hop rotr = dstination rotr rotr Intrnt Tchnolog 8. Roting sitch rotr LAN Pal Kranoski Rtgrs Unirsit Spring 6 LAN Roting algorithm:

More information

RFC Java Class Library (BC-FES-AIT)

RFC Java Class Library (BC-FES-AIT) RFC Java Class Library (BC-FES-AIT) HELP.BCFESDEG Rlas 4.6C SAP AG Copyright Copyright 2001 SAP AG. All Rcht vorbhaltn. Witrgab und Vrvilfältigung disr Publikation odr von Tiln daraus sind, zu wlchm Zwck

More information

Lesson Focus: Finding Equivalent Fractions

Lesson Focus: Finding Equivalent Fractions Lsson Plans: Wk of 1-26-15 M o n Bindrs: /Math;; complt on own, thn chck togthr Basic Fact Practic Topic #10 Lsson #5 Lsson Focus: Finding Equivalnt Fractions *Intractiv Larning/Guidd Practic-togthr in

More information

Keywords-- Digital FIR filter, Differential Evolution algorithm, Magnitude response, Pass band ripples and Stop band ripples.

Keywords-- Digital FIR filter, Differential Evolution algorithm, Magnitude response, Pass band ripples and Stop band ripples. Volum 5, Issu 6, Jun 2015 ISSN: 2277 128X Intrnational Journal of Advancd Rsarch in Computr Scinc and Softwar Enginring Rsarch Papr Availabl onlin at: www.iarcss.com High Pass Digital FIR Filtr Dsign Using

More information

i e ai E ig e v / gh E la ES h E A X h ES va / A SX il E A X a S

i e ai E ig e v / gh E la ES h E A X h ES va / A SX il E A X a S isto C o C or Co r op ra p a py ag yr g ri g g gh ht S S S V V K r V K r M K v M r v M rn v MW n W S r W Sa r W K af r: W K f : a H a M r T H r M rn w T H r Mo ns w T i o S ww c ig on a w c g nd af ww

More information

Electronic Supplementary Materials. Contents. Tag Data

Electronic Supplementary Materials. Contents. Tag Data Elctronic Supplmntary Matrials For th manuscript: Titl: First dirct masurmnts of bhavioural rsponss by Cuvir s bakd whals to mid-frquncy activ (MFA) sonar [Short Titl: Ziphius rspons to MFA sonar] Authors:

More information

Tillförlitlig dimensionering mot utmattning UTMIS Vårmöte 2018 på Högskolan i Skövde

Tillförlitlig dimensionering mot utmattning UTMIS Vårmöte 2018 på Högskolan i Skövde Tillförlitlig dimnsionring mot utmattning UTMIS Vårmöt 2018 på Högskolan i Skövd Rami Mansour & Mårtn Olsson KTH Hållfasthtslära mart@kth.s ramimans@kth.s Introduction Ovrviw of rliabl dsign Traditional

More information

Group 2 Mega Crystals Usability Test Report

Group 2 Mega Crystals Usability Test Report Group 2 Mga Crystals Usability Tst Rport Rport Writtn By Katrina Ellis Tam Mmbrs Usr Exprinc Consultants Katrina Ellis Zhitao Qiu HU4628 Julia Wiss Sarah Ingold Jams Staplton CS4760 Kris Gauthir (Android)

More information

This module calculates the motor speed based on a rotor position measurement when the direction information is available.

This module calculates the motor speed based on a rotor position measurement when the direction information is available. SPEED_FRQ Spd Calulator Basd on Rotor Angl With Dirtion Information Dsription This modul alulats th motor spd basd on a rotor position masurmnt whn th dirtion information is availabl. thta_l dir_qep SPEED_FRQ

More information

About Notes And Symbols

About Notes And Symbols About Nots And Symbols by Batric Wildr Contnts Sht 1 Sht 2 Sht 3 Sht 4 Sht 5 Sht 6 Sht 7 Sht 8 Sht 9 Sht 10 Sht 11 Sht 12 Sht 13 Sht 14 Sht 15 Sht 16 Sht 17 Sht 18 Sht 19 Sht 20 Sht 21 Sht 22 Sht 23 Sht

More information

FSP Synthesis of an off-set five bar-slider mechanism with variable topology

FSP Synthesis of an off-set five bar-slider mechanism with variable topology FSP Synthsis of an off-st fiv bar-slidr mchanism with variabl topology Umsh. M. Daivagna 1*, Shrinivas. S. Balli 2 1 Dpartmnt of Mchanical Enginring, S.T.J.Institut of Tchnology, Ranbnnur, India 2 Dpt.

More information

Clustering Belief Functions using Extended Agglomerative Algorithm

Clustering Belief Functions using Extended Agglomerative Algorithm IJ Imag Graphics and Signal Procssing 0 - Publishd Onlin Fbruary 0 in MECS (http://wwwmcs-prssorg/ ing Blif Functions using Extndd Agglomrativ Algorithm Ying Png Postgraduat Collg Acadmy of Equipmnt Command

More information

Objectives. Two Ways to Implement Lists. Lists. Chapter 24 Implementing Lists, Stacks, Queues, and Priority Queues

Objectives. Two Ways to Implement Lists. Lists. Chapter 24 Implementing Lists, Stacks, Queues, and Priority Queues Chaptr 24 Implmnting Lists, Stacks, Quus, and Priority Quus CS2: Data Structurs and Algorithms Colorado Stat Univrsity Original slids by Danil Liang Modifid slids by Chris Wilcox Objctivs q To dsign common

More information

I - Pre Board Examination

I - Pre Board Examination Cod No: S-080 () Total Pags: 06 KENDRIYA VIDYALAYA SANGATHAN,GUWHATI REGION I - Pr Board Examination - 04-5 Subjct Informatics Practics (Thory) Class - XII Tim: 3 hours Maximum Marks : 70 Instruction :

More information

Graphing Calculator Activities

Graphing Calculator Activities Graphing Calculator Activitis Graphing Calculator Activitis Copyright 009, IPG Publishing IPG Publishing 86 Erin Bay Edn Prairi, innsota 47 phon: (6) 80-9090 www.iplaymathgams.com ISBN 978--948--6 IPG

More information

Acceleration of the Smith-Waterman Algorithm using Single and Multiple Graphics Processors

Acceleration of the Smith-Waterman Algorithm using Single and Multiple Graphics Processors Acclration of th Smith-Watrman Algorithm using Singl and Multipl Graphics Procssors Ali Khah-Sad, Stphn Pool and J. Blair Prot Abstract Finding rgions of similarity btwn two vry long data strams is a computationally

More information

Throughput Parameter Optimization of Adaptive ARQ/HARQ Scheme

Throughput Parameter Optimization of Adaptive ARQ/HARQ Scheme 89 Throughput Paramtr Optimization of Adaptiv ARQ/HARQ Schm Ján Poctavk, Kvtoslava Kotuliaková, Jaroslav Polc, Michal Osadský, Sandra Ondrušová Dpt. of Tlcommunications, Slovak Univrsity of Tchnology Bratislava,

More information

Heading-determination using the sensor-fusion based maritime PNT Unit

Heading-determination using the sensor-fusion based maritime PNT Unit Hading-dtrmination using th snsor-fusion basd maritim PN Unit Zhn Dai, Ralf Zibold, Alxandr Born, Evlin Englr Grman Arospac Cntr (DLR) Nustrlitz, Grmany Abstract his papr prsnts th hading dtrmination tchniqu

More information

Fuzzy Intersection and Difference Model for Topological Relations

Fuzzy Intersection and Difference Model for Topological Relations IFS-EUSFLT 009 Fuzzy Intrsction and Diffrnc Modl for Topological Rlations hd LOODY Flornc SEDES Jordi INGLD 3 Univrsité Paul Sabatir (UPS) Toulous, 8 Rout d Narbonn, F-306-CEDEX 9, Franc Institut d Rchrchn

More information

CS246: Mining Massive Datasets Jure Leskovec, Stanford University.

CS246: Mining Massive Datasets Jure Leskovec, Stanford University. CS246: Mining Massiv Datasts Jur Lskovc, Stanford Univrsity ttp://cs246.stanford.du 11/26/2010 Jur Lskovc, Stanford C246: Mining Massiv Datasts 2 Givn a st of points, wit a notion of distanc btwn points,

More information

Ranking Overlap and Outlier Points in Data using Soft Kernel Spectral Clustering

Ranking Overlap and Outlier Points in Data using Soft Kernel Spectral Clustering ESANN procdings, Europan Symposium on Artificial Nural Ntworks, Computational Intllignc and Machin Larning. Brugs (Blgium), - April, idoc.com publ., ISBN 978-8787-8. Ranking Ovrlap and Outlir Points in

More information

KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION CLASS XII COMMON PRE-BOARD EXAMINATION

KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION CLASS XII COMMON PRE-BOARD EXAMINATION KENDRIYA VIDYALAYA SANGATHAN, CHENNAI REGION CLASS XII COMMON PRE-BOARD EXAMINATION 03-4 Sub : Informatics Practics (065) Tim allowd : 3 hours Maximum Marks : 70 Instruction : (i) All qustions ar compulsory

More information

FALSE DYNAMIC EIV MODEL IDENTIFICATION IN THE PRESENCE OF NON-PARAMETRIC DYNAMIC UNCERTAINTY

FALSE DYNAMIC EIV MODEL IDENTIFICATION IN THE PRESENCE OF NON-PARAMETRIC DYNAMIC UNCERTAINTY Intrnational Journal of Application or Innovation in Enginring & Managmnt (IJAIEM) Wb Sit: www.ijaim.org Email: ditor@ijaim.org Volum 3, Issu, May 4 ISSN 39-4847 FALSE DYNAMIC EIV MODEL IDENTIFICATION

More information

TypeCastor: Demystify Dynamic Typing of JavaScript Applications

TypeCastor: Demystify Dynamic Typing of JavaScript Applications TypCastor: Dmystify Dynamic Typing of JavaScript Applications Shishng Li China Runtim Tch Cntr Intl China Rsarch Cntr Bijing, China shishng.li@intl.com Buqi Chng China Runtim Tch Cntr Intl China Rsarch

More information

Dynamic Light Trail Routing and Protection Issues in WDM Optical Networks

Dynamic Light Trail Routing and Protection Issues in WDM Optical Networks This full txt papr was pr rviwd at th dirction of IEEE Communications Socity subjct mattr xprts for publication in th IEEE GLOBECOM 2005 procdings. Dynamic Light Trail Routing and Protction Issus in WDM

More information

Principles of Programming Languages Topic: Formal Languages II

Principles of Programming Languages Topic: Formal Languages II Principls of Programming Languags Topic: Formal Languags II CS 34,LS, LTM, BR: Formal Languags II Rviw A grammar can b ambiguous i.. mor than on pars tr for sam string of trminals in a PL w want to bas

More information

Space Subdivision Algorithms for Ray Tracing

Space Subdivision Algorithms for Ray Tracing Spac Subdivision Algorithms for Ray Tracing by David MacDonald A thsis prsntd to th Univrsity of Watrloo in fulfillmnt of th thsis rquirmnt for th dgr of Mastr of Mathmatics in Computr Scinc Watrloo, Ontario,

More information

Call Admission Control in IEEE e EDCA-based WLANs (Initial Steps)

Call Admission Control in IEEE e EDCA-based WLANs (Initial Steps) Call Admission Control in IEEE 8. EDCA-basd WLANs (Initial Stps) Boris Bllalta, Michla Mo, Miqul Olivr () Univrsitat Pompu Fabra P. Circumval lació, 8, 8 Barclona, Spain Tl: + 9 5 8 95 Email: boris.bllalta@upf.du

More information

Reducin} Migratin} secxn:laries

Reducin} Migratin} secxn:laries Rducing Migrating Scondaris Earl Wallr and Ml Parc INLEX, Inc. P.O. Box 1349 Montry, CA. 93942 If you ar lik us, you hav rad a lot rcntly about IMAGE and its 'myths', and you know that thr can b prformanc

More information

AUGMENTED ROBUST PCA FOR FOREGROUND-BACKGROUND SEPARATION ON NOISY, MOVING CAMERA VIDEO. Chen Gao, Brian E. Moore, and Raj Rao Nadakuditi

AUGMENTED ROBUST PCA FOR FOREGROUND-BACKGROUND SEPARATION ON NOISY, MOVING CAMERA VIDEO. Chen Gao, Brian E. Moore, and Raj Rao Nadakuditi AUGMENTED ROBUST PCA FOR FOREGROUND-BACKGROUND SEPARATION ON NOISY, MOVING CAMERA VIDEO Chn Gao, Brian E. Moor, and Raj Rao Nadakuditi Dpartmnt of EECS, Univrsity of Michigan, Ann Arbor, MI, 4809 ABSTRACT

More information

Dynamic Spatial Partitioning for Real-Time Visibility Determination

Dynamic Spatial Partitioning for Real-Time Visibility Determination Dynamic Spatial Partitioning for Ral-Tim Visibility Dtrmination Joshua Shagam Josph J. Pfiffr, Jr. Nw Mxico Stat Univrsity Abstract Th static spatial partitioning mchanisms usd in currnt intractiv systms,

More information

How to fix your 260Z or 280Z clock.

How to fix your 260Z or 280Z clock. Sujt Fixing th Kanto Siki lok Author E. Bttio How to fix your 260Z or 280Z lok. I first wrot this up aout two yars ago. This is th sond vrsion of this produr. It is not vry muh diffrnt to my first ffort

More information

CS364B: Frontiers in Mechanism Design Lecture #10: Coverage Valuations and Convex Rounding

CS364B: Frontiers in Mechanism Design Lecture #10: Coverage Valuations and Convex Rounding CS364B: Frontirs in Mchanism Dsign Lctur #10: Covrag Valuations and Convx Rounding Tim Roughgardn Fbruary 5, 2014 1 Covrag Valuations Rcall th stting of submodular biddr valuations, introducd in Lctur

More information

EXTENSION OF RCC TOPOLOGICAL RELATIONS FOR 3D COMPLEX OBJECTS COMPONENTS EXTRACTED FROM 3D LIDAR POINT CLOUDS

EXTENSION OF RCC TOPOLOGICAL RELATIONS FOR 3D COMPLEX OBJECTS COMPONENTS EXTRACTED FROM 3D LIDAR POINT CLOUDS Th Intrnational rchivs of th Photogrammtry, mot Snsing and Spatial Information Scincs, Volum XLI-, 016 XXIII ISPS Congrss, 1 19 July 016, Pragu, Czch public EXTENSION OF CC TOPOLOGICL ELTIONS FO D COMPLEX

More information

Extended version: GPU Ray-Traced Collision Detection for Cloth Simulation

Extended version: GPU Ray-Traced Collision Detection for Cloth Simulation Extndd vrsion: GPU Ray-Tracd Collision Dtction for Cloth Simulation François Lhricy, Valéri Gouranton, Bruno Arnaldi To cit this vrsion: François Lhricy, Valéri Gouranton, Bruno Arnaldi. Extndd vrsion:

More information

Stress-based Topology Optimization of Thermal Structures

Stress-based Topology Optimization of Thermal Structures 10 World Congrss on Structural and Multidisciplinary Optimization May 19-24, 2013, Orlando, Florida, USA Strss-basd opology Optimization of hrmal Structurs Joshua D. Daton 1, Ramana V. Grandhi 1 1 Wright

More information

Multi-hypothesis Motion Planning for Visual Object Tracking

Multi-hypothesis Motion Planning for Visual Object Tracking Multi-hypothsis Motion Planning or Visual Objct Tracking Haing Gong, Jack Sim, Maxim Likhachv, Jianbo Shi GRASP Lab, Univrsity o Pnnsylvania Robotics Institut, Carngi Mllon Univrsity hgong@sas.upnn.u,

More information

Outline. Tasks for Exercise Six. Exercise Six Goals. Task One: Kinetic Energy Table. Nested for Loops. Laboratory VI Program Control Using Loops

Outline. Tasks for Exercise Six. Exercise Six Goals. Task One: Kinetic Energy Table. Nested for Loops. Laboratory VI Program Control Using Loops Ercis 6 -- Loopig March 9, 6 Laboratory VI Program Cotrol Usig Loops Larry Cartto Computr Scic 6 Computig i Egirig ad Scic Outli Ercis si goals Outli tasks for rcis si Itroduc ida of std loops ad tabl

More information

AN EVALUATION MODEL FOR THE CHAINS OF DISTRIBUTED MULTIMEDIA INDEXING TOOLS RESPECTING USER PREFERENCES

AN EVALUATION MODEL FOR THE CHAINS OF DISTRIBUTED MULTIMEDIA INDEXING TOOLS RESPECTING USER PREFERENCES AN EVALUATION MODEL FOR THE CHAINS OF DISTRIBUTED MULTIMEDIA INDEXING TOOLS RESPECTING USER PREFERENCES 1 Bassm HAIDAR, 2 Bilal CHEBARO, 3 Hassan WEHBI 1 Asstt Prof., Dpartmnt of Computr Scincs, Faculty

More information

Keywords: Steffensen quadrature rule, Gauss- Legendre quadrature rules, mixed quadrature rules, adaptive integration scheme.

Keywords: Steffensen quadrature rule, Gauss- Legendre quadrature rules, mixed quadrature rules, adaptive integration scheme. SSN: 9-596 SO 9:8 Crtifid ntrnational Journal of Enginring Scinc and nnovativ Tchnology (JEST) Volum, ssu, July Evaluation of mpropr ntgrals in th Adaptiv ntgration Schm Basd On Opn Typ Mid Ruls Dbasish

More information

Review of Different Histogram Equalization Based Contrast Enhancement Techniques

Review of Different Histogram Equalization Based Contrast Enhancement Techniques Intrnational Journal of Advancd Rsarch in Computr and Communication Enginring Vol. 3, Issu 7, July 24 ISSN (Onlin) : 2278-2 Rviw of Diffrnt Histogram Equalization Basd Contrast Enhancmnt Tchniqus Er. Shfali

More information