CIS570 Lecture 4 Introduction to Data-flow Analysis 3
|
|
- Fay Chase
- 8 years ago
- Views:
Transcription
1 Introdution to Data-flow Analysis Last Time Control flow analysis BT disussion Today Introdue iterative data-flow analysis Liveness analysis Introdue other useful onepts CIS570 Leture 4 Introdution to Data-flow Analysis Data-flow Analysis Idea Data-flow analysis derives information about the dynami behavior of a program by only examining the stati ode Example How many registers do we need for the program on the right? Easy bound: the number of variables used () Better answer is found by onsidering the dynami requirements of the program L1: b := a + 1 := + b 5 if a < 9 goto L1 CIS570 Leture 4 Introdution to Data-flow Analysis 1
2 Liveness Analysis Definition A variable is live at a partiular point in the program if its value at that point will be used in the future (dead, otherwise). To ompute liveness at a given point, we need to look into the future Motivation: Register Alloation A program ontains an unbounded number of variables Must exeute on a mahine with a bounded number of registers Two variables an use the same register if they are never in use at the same time (i.e, never simultaneously live). Register alloation uses liveness information CIS570 Leture 4 Introdution to Data-flow Analysis 4 Control Flow Graphs (CFGs) Simplifiation For now, we will use CFG s in whih nodes represent program statements rather than basi bloks Example 1 a = 0 L1: b := a + 1 := + b 5 if a < 9 goto L1 b = a + 1 = + b 4 a = b * 5 a<9 6 return CIS570 Leture 4 Introdution to Data-flow Analysis 5
3 Liveness by Example What is the live range of b? Variable b is read in statement 4, so b is live on the ( 4) edge Sine statement does not assign into b, b is also live on the ( ) edge Statement assigns b, so any value of b on the (1 ) and (5 ) edges are not needed, so b is dead along these edges b s live range is ( 4) 6 return 1 a = 0 b = a a = b * 5 = + b a<9 CIS570 Leture 4 Introdution to Data-flow Analysis 6 Liveness by Example (ont) Live range of a a is live from (1 ) and again from (4 5 ) a is dead from ( 4) 1 a = 0 b = a + 1 Live range of b b is live from ( 4) Live range of is live from (entry 1 4 5, 5 6) 6 return 5 = + b 4 a = b * a<9 Variables a and b are never simultaneously live, so they an share a register CIS570 Leture 4 Introdution to Data-flow Analysis 7
4 Terminology Flow Graph Terms A CFG node has out-edges that lead to suessor nodes and in-edges that ome from predeessor nodes pred[n] is the set of all predeessors of node n 1 a = 0 su[n] is the set of all suessors of node n Examples Out-edges of node 5: su[5] = pred[5] = pred[] = {,6} {4} {1,5} (5 6) and (5 ) 6 return 5 b = a + 1 = + b 4 a = b * a<9 CIS570 Leture 4 Introdution to Data-flow Analysis 8 Uses and Defs Def (or definition) An assignment of a value to a variable def[v] = set of CFG nodes that define variable v def[n] = set of variables that are defined at node n a = 0 Use A read of a variable s value use[v] = set of CFG nodes that use variable v use[n] = set of variables that are used at node n a < 9? v live def[v] More preise definition of liveness A variable v is live on a CFG edge if use[v] (1) a direted path from that edge to a use of v (node in use[v]), and () that path does not go through any def of v (no nodes in def[v]) CIS570 Leture 4 Introdution to Data-flow Analysis 9 4
5 The Flow of Liveness Data-flow Liveness of variables is a property that flows through the edges of the CFG Diretion of Flow Liveness flows bakwards through the CFG, beause the behavior at future nodes determines liveness at a given node Consider a Consider b Later, we ll see other properties that flow forward 4 5 b := a + 1 := + b a := b * a < 9? CIS570 Leture 4 Introdution to Data-flow Analysis 10 Liveness at des edges We have liveness on edges just before omputation How do we talk about a = 0 just after omputation liveness at nodes? Two More Definitions A variable is live-out at a node if it is live on any b of := that a node s + 1 outedges := + b n live-out out-edges 4 a := b * A variable is live-in at a node if it is live on any 5 of that a < node s 9? in-edges n live-in in-edges program points CIS570 Leture 4 Introdution to Data-flow Analysis 11 5
6 Computing Liveness Rules for omputing liveness (1) Generate liveness: If a variable is in use[n], it is live-in at node n Data-flow equations (1) in[n] = use[n] (out[n] def[n]) () n live-in use () Push liveness aross edges: If a variable is live-in at a node n then it is live-out at all nodes in pred[n] live-out () Push liveness aross nodes: If a variable is live-out at node n and not in def[n] then the variable is also live-in at n live-out n live-in live-out live-in n live-out pred[n] out[n] = in[s] s su[n] () CIS570 Leture 4 Introdution to Data-flow Analysis 1 Solving the Data-flow Equations Algorithm for eah node n in CFG in[n] = ; out[n] = repeat for eah node n in CFG in [n] = in[n] out [n] = out[n] in[n] = use[n] (out[n] def[n]) out[n] = in[s] s su[n] until in [n]=in[n] and out [n]=out[n] for all n initialize solutions save urrent results solve data-flow equations test for onvergene This is iterative data-flow analysis (for liveness analysis) CIS570 Leture 4 Introdution to Data-flow Analysis 1 6
7 Example node # 1 a a b b 5 a 1st nd rd 4th 5th 6th 7th use def in out in out in out in out in out in out in out 4 b a 6 a b b a a a a b b b b a a a a a b b b b a a a a a b b b b a a a a a b b b b a a a a a b b b b a a a a a b b b b a a a b := a + 1 := + b Data-flow Equations for Liveness in[n] = use[n] (out[n] def[n]) out[n] = in[s] s su[n] CIS570 Leture 4 Introdution to Data-flow Analysis 14 Example (ont) Data-flow Equations for Liveness in[n] = use[n] (out[n] def[n]) out[n] = in[s] s su[n] Improving Performane Consider the ( 4) edge in the graph: out[4] is used to ompute in[4] in[4] is used to ompute out[]... So we should ompute the sets in the order: out[4], in[4], out[], in[],... out[] in[4] out[4] b := a + 1 := + b The order of omputation should follow the diretion of flow CIS570 Leture 4 Introdution to Data-flow Analysis 15 7
8 Iterating Through the Flow Graph Bakwards node # 1st nd rd use def out in out in out in 6 5 a a a a a a 4 b a a b a b a b b b b b b b b a b b a b a b a 1 a a a a Converges muh faster! b := a + 1 := + b CIS570 Leture 4 Introdution to Data-flow Analysis 16 Solving the Data-flow Equations (reprise) Algorithm for eah node n in CFG in[n] = ; out[n] = repeat for eah node n in CFG in reverse topsort order in [n] = in[n] Save urrent results out [n] = out[n] out[n] = in[s] s su[n] Solve data-flow equations in[n] = use[n] (out[n] def[n]) until in [n]=in[n] and out [n]=out[n] for all n Initialize solutions Test for onvergene CIS570 Leture 4 Introdution to Data-flow Analysis 17 8
9 Time Complexity Consider a program of size N Has N nodes in the flow graph (and at most N variables) Eah live-in or live-out set has at most N elements Eah set-union operation takes O(N) time The for loop body onstant # of set operations per node O(N) nodes O(N ) time for the loop Eah iteration of the repeat loop an only make the set larger Eah set an ontain at most N variables N iterations Worst ase: O(N 4 ) Typial ase: to iterations with good ordering & sparse sets O(N) to O(N ) CIS570 Leture 4 Introdution to Data-flow Analysis 18 More Performane Considerations Basi bloks Derease the size of the CFG by merging nodes that have a single predeessor and a single suessor into basi bloks 1 a := 0 b := a + 1 (requires loal analysis before and after global := + 1 analysis) a := b * + b a > 9? One variable at a time 4 a := b * Instead of omputing data-flow information return for all variables at one using sets, ompute a (simplified) analysis for eah variable separately Representation of sets For dense sets, use a bit vetor representation For sparse sets, use a sorted list (e.g., linked list) CIS570 Leture 4 Introdution to Data-flow Analysis 19 9
10 Conservative Approximation node # X Y Z use def in out in out in out 1 a a d ad a a b a b ad bd a b b b b bd bd b b 4 b a b a bd ad b a 5 a a a ad ad a a 6 b := a + 1 := + b Solution X Our solution as omputed on previous slides CIS570 Leture 4 Introdution to Data-flow Analysis 0 Conservative Approximation (ont) node # X Y Z use def in out in out in out 1 a a d ad a a b a b ad bd a b b b b bd bd b b 4 b a b a bd ad b a 5 a a a ad ad a a 6 b := a + 1 := + b Solution Y Carries variable d uselessly around the loop Does Y solve the equations? Is d live? Does Y lead to a orret program? Impreise onservative solutions sub-optimal but orret programs CIS570 Leture 4 Introdution to Data-flow Analysis 1 10
11 Conservative Approximation (ont) node # X Y Z use def in out in out in out 1 a a d ad a a b a b ad bd a b b b b bd bd b b 4 b a b a bd ad b a 5 a a a ad ad a a 6 b := a + 1 := + b Solution Z Does not identify as live in all ases Does Z solve the equations? Does Z lead to a orret program? n-onservative solutions inorret programs CIS570 Leture 4 Introdution to Data-flow Analysis The Need for Approximations Stati vs. Dynami Liveness In the following graph, b*b is always non-negative, so >= b is always true and a s value will never be used after node 1 a := b * b := a + b >= b? 4 return a 5 return Rule () for omputing liveness Sine a is live-in at node 4, it is live-out at nodes and This rule ignores atual ontrol flow ompiler an statially know all a program s dynami properties! CIS570 Leture 4 Introdution to Data-flow Analysis 11
12 Conepts Liveness Use in register alloation Generating liveness Flow and diretion Data-flow equations and analysis Complexity Improving performane (basi bloks, single variable, bit sets) Control flow graphs Predeessors and suessors Defs and uses Conservative approximation Stati versus dynami liveness CIS570 Leture 4 Introdution to Data-flow Analysis 4 Next Time Leture Generalizing data-flow analysis CIS570 Leture 4 Introdution to Data-flow Analysis 5 1
Introduction to Data-flow analysis
Introduction to Data-flow analysis Last Time LULESH intro Typed, 3-address code Basic blocks and control flow graphs LLVM Pass architecture Data dependencies, DU chains, and SSA Today CFG and SSA example
More informationStatic Fairness Criteria in Telecommunications
Teknillinen Korkeakoulu ERIKOISTYÖ Teknillisen fysiikan koulutusohjelma 92002 Mat-208 Sovelletun matematiikan erikoistyöt Stati Fairness Criteria in Teleommuniations Vesa Timonen, e-mail: vesatimonen@hutfi
More information5.2 The Master Theorem
170 CHAPTER 5. RECURSION AND RECURRENCES 5.2 The Master Theorem Master Theorem In the last setion, we saw three different kinds of behavior for reurrenes of the form at (n/2) + n These behaviors depended
More informationComputer Networks Framing
Computer Networks Framing Saad Mneimneh Computer Siene Hunter College of CUNY New York Introdution Who framed Roger rabbit? A detetive, a woman, and a rabbit in a network of trouble We will skip the physial
More informationProgramming Basics - FORTRAN 77 http://www.physics.nau.edu/~bowman/phy520/f77tutor/tutorial_77.html
CWCS Workshop May 2005 Programming Basis - FORTRAN 77 http://www.physis.nau.edu/~bowman/phy520/f77tutor/tutorial_77.html Program Organization A FORTRAN program is just a sequene of lines of plain text.
More informationLecture 2 Introduction to Data Flow Analysis
Lecture 2 Introduction to Data Flow Analysis I. Introduction II. Example: Reaching definition analysis III. Example: Liveness analysis IV. A General Framework (Theory in next lecture) Reading: Chapter
More informationSebastián Bravo López
Transfinite Turing mahines Sebastián Bravo López 1 Introdution With the rise of omputers with high omputational power the idea of developing more powerful models of omputation has appeared. Suppose that
More informationFixed-income Securities Lecture 2: Basic Terminology and Concepts. Present value (fixed interest rate) Present value (fixed interest rate): the arb
Fixed-inome Seurities Leture 2: Basi Terminology and Conepts Philip H. Dybvig Washington University in Saint Louis Various interest rates Present value (PV) and arbitrage Forward and spot interest rates
More informationAn Enhanced Critical Path Method for Multiple Resource Constraints
An Enhaned Critial Path Method for Multiple Resoure Constraints Chang-Pin Lin, Hung-Lin Tai, and Shih-Yan Hu Abstrat Traditional Critial Path Method onsiders only logial dependenies between related ativities
More informationChannel Assignment Strategies for Cellular Phone Systems
Channel Assignment Strategies for Cellular Phone Systems Wei Liu Yiping Han Hang Yu Zhejiang University Hangzhou, P. R. China Contat: wliu5@ie.uhk.edu.hk 000 Mathematial Contest in Modeling (MCM) Meritorious
More informationCIS570 Lecture 9 Reuse Optimization II 3
Reuse Optimization Last time Discussion (SCC) Loop invariant code motion Reuse optimization: Value numbering Today More reuse optimization Common subexpression elimination (CSE) Partial redundancy elimination
More informationAutomated Test Generation from Vulnerability Signatures
Automated Test Generation from Vulneraility Signatures Adulaki Aydin, Muath Alkhalaf, and Tevfik Bultan Computer Siene Department University of California, Santa Barara Email: {aki,muath,ultan}@s.us.edu
More information1.3 Complex Numbers; Quadratic Equations in the Complex Number System*
04 CHAPTER Equations and Inequalities Explaining Conepts: Disussion and Writing 7. Whih of the following pairs of equations are equivalent? Explain. x 2 9; x 3 (b) x 29; x 3 () x - 2x - 22 x - 2 2 ; x
More informationChapter 1 Microeconomics of Consumer Theory
Chapter 1 Miroeonomis of Consumer Theory The two broad ategories of deision-makers in an eonomy are onsumers and firms. Eah individual in eah of these groups makes its deisions in order to ahieve some
More informationUser s Guide VISFIT: a computer tool for the measurement of intrinsic viscosities
File:UserVisfit_2.do User s Guide VISFIT: a omputer tool for the measurement of intrinsi visosities Version 2.a, September 2003 From: Multiple Linear Least-Squares Fits with a Common Interept: Determination
More informationThe Design of Vector Programs
Algorithmi Languages, de Bakker/van Vliet (eds.) FP, North-Holland Publishing ompany, 1981,99-114 The Design of Vetor Programs Alain Bossavit and Bertrand Meyer Diretion des Etudes et Reherhes, Eletriite
More informationComputational Analysis of Two Arrangements of a Central Ground-Source Heat Pump System for Residential Buildings
Computational Analysis of Two Arrangements of a Central Ground-Soure Heat Pump System for Residential Buildings Abstrat Ehab Foda, Ala Hasan, Kai Sirén Helsinki University of Tehnology, HVAC Tehnology,
More informationCSE 504: Compiler Design. Data Flow Analysis
Data Flow Analysis Pradipta De pradipta.de@sunykorea.ac.kr Current Topic Iterative Data Flow Analysis LiveOut sets Static Single Assignment (SSA) Form Data Flow Analysis Techniques to reason about runtime
More informationIn this chapter, we ll see state diagrams, an example of a different way to use directed graphs.
Chapter 19 State Diagrams In this hapter, we ll see state diagrams, an example of a different way to use direted graphs. 19.1 Introdution State diagrams are a type of direted graph, in whih the graph nodes
More informationA Context-Aware Preference Database System
J. PERVASIVE COMPUT. & COMM. (), MARCH 005. TROUBADOR PUBLISHING LTD) A Context-Aware Preferene Database System Kostas Stefanidis Department of Computer Siene, University of Ioannina,, kstef@s.uoi.gr Evaggelia
More informationThe Basics of International Trade: A Classroom Experiment
The Basis of International Trade: A Classroom Experiment Alberto Isgut, Ganesan Ravishanker, and Tanya Rosenblat * Wesleyan University Abstrat We introdue a simple web-based lassroom experiment in whih
More informationarxiv:astro-ph/0304006v2 10 Jun 2003 Theory Group, MS 50A-5101 Lawrence Berkeley National Laboratory One Cyclotron Road Berkeley, CA 94720 USA
LBNL-52402 Marh 2003 On the Speed of Gravity and the v/ Corretions to the Shapiro Time Delay Stuart Samuel 1 arxiv:astro-ph/0304006v2 10 Jun 2003 Theory Group, MS 50A-5101 Lawrene Berkeley National Laboratory
More informationThe PageRank Citation Ranking: Bring Order to the Web
The PageRank Citation Ranking: Bring Order to the Web presented by: Xiaoxi Pang 25.Nov 2010 1 / 20 Outline Introduction A ranking for every page on the Web Implementation Convergence Properties Personalized
More informationcos t sin t sin t cos t
Exerise 7 Suppose that t 0 0andthat os t sin t At sin t os t Compute Bt t As ds,andshowthata and B ommute 0 Exerise 8 Suppose A is the oeffiient matrix of the ompanion equation Y AY assoiated with the
More informationCapacity at Unsignalized Two-Stage Priority Intersections
Capaity at Unsignalized Two-Stage Priority Intersetions by Werner Brilon and Ning Wu Abstrat The subjet of this paper is the apaity of minor-street traffi movements aross major divided four-lane roadways
More informationImproved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules
Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu
More information) ( )( ) ( ) ( )( ) ( ) ( ) (1)
OPEN CHANNEL FLOW Open hannel flow is haraterized by a surfae in ontat with a gas phase, allowing the fluid to take on shapes and undergo behavior that is impossible in a pipe or other filled onduit. Examples
More informationRecovering Articulated Motion with a Hierarchical Factorization Method
Reovering Artiulated Motion with a Hierarhial Fatorization Method Hanning Zhou and Thomas S Huang University of Illinois at Urbana-Champaign, 405 North Mathews Avenue, Urbana, IL 680, USA {hzhou, huang}@ifpuiuedu
More informationWORKFLOW CONTROL-FLOW PATTERNS A Revised View
WORKFLOW CONTROL-FLOW PATTERNS A Revised View Nik Russell 1, Arthur H.M. ter Hofstede 1, 1 BPM Group, Queensland University of Tehnology GPO Box 2434, Brisbane QLD 4001, Australia {n.russell,a.terhofstede}@qut.edu.au
More informationImproved SOM-Based High-Dimensional Data Visualization Algorithm
Computer and Information Siene; Vol. 5, No. 4; 2012 ISSN 1913-8989 E-ISSN 1913-8997 Published by Canadian Center of Siene and Eduation Improved SOM-Based High-Dimensional Data Visualization Algorithm Wang
More informationTHERMAL TO MECHANICAL ENERGY CONVERSION: ENGINES AND REQUIREMENTS Vol. I - Thermodynamic Cycles of Reciprocating and Rotary Engines - R.S.
THERMAL TO MECHANICAL ENERGY CONVERSION: ENGINES AND REQUIREMENTS Vol. I - Thermodynami Cyles of Reiproating and Rotary Engines - R.S.Kavtaradze THERMODYNAMIC CYCLES OF RECIPROCATING AND ROTARY ENGINES
More informationClassical Electromagnetic Doppler Effect Redefined. Copyright 2014 Joseph A. Rybczyk
Classial Eletromagneti Doppler Effet Redefined Copyright 04 Joseph A. Rybzyk Abstrat The lassial Doppler Effet formula for eletromagneti waves is redefined to agree with the fundamental sientifi priniples
More informationImpedance Method for Leak Detection in Zigzag Pipelines
10.478/v10048-010-0036-0 MEASUREMENT SCIENCE REVIEW, Volume 10, No. 6, 010 Impedane Method for Leak Detetion in igzag Pipelines A. Lay-Ekuakille 1, P. Vergallo 1, A. Trotta 1 Dipartimento d Ingegneria
More informationOpen and Extensible Business Process Simulator
UNIVERSITY OF TARTU FACULTY OF MATHEMATICS AND COMPUTER SCIENCE Institute of Computer Siene Karl Blum Open and Extensible Business Proess Simulator Master Thesis (30 EAP) Supervisors: Luiano Garía-Bañuelos,
More informationPerformance Analysis of IEEE 802.11 in Multi-hop Wireless Networks
Performane Analysis of IEEE 80.11 in Multi-hop Wireless Networks Lan Tien Nguyen 1, Razvan Beuran,1, Yoihi Shinoda 1, 1 Japan Advaned Institute of Siene and Tehnology, 1-1 Asahidai, Nomi, Ishikawa, 93-19
More informationBehavior Analysis-Based Learning Framework for Host Level Intrusion Detection
Behavior Analysis-Based Learning Framework for Host Level Intrusion Detetion Haiyan Qiao, Jianfeng Peng, Chuan Feng, Jerzy W. Rozenblit Eletrial and Computer Engineering Department University of Arizona
More informationWhy have SSA? Birth Points (cont) Birth Points (a notion due to Tarjan)
Why have SSA? Building SSA Form SSA-form Each name is defined exactly once, thus Each use refers to exactly one name x 17-4 What s hard? Straight-line code is trivial Splits in the CFG are trivial x a
More informationmove Considered Harmful: Abstractions for Mobile Languages
move Considered Harmful: Abstrations for Mobile Languages Laboratorium voor Programmeerkunde Vrije Universiteit Brussel Pleinlaan 2 1040 Brussel - Belgium Sketh Introdution - Researh Context & Vision -
More informationIEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, VOL. 9, NO. 3, MAY/JUNE 2012 401
IEEE TRASACTIOS O DEPEDABLE AD SECURE COMPUTIG, VOL. 9, O. 3, MAY/JUE 2012 401 Mitigating Distributed Denial of Servie Attaks in Multiparty Appliations in the Presene of Clok Drifts Zhang Fu, Marina Papatriantafilou,
More informationOutline. Planning. Search vs. Planning. Search vs. Planning Cont d. Search vs. planning. STRIPS operators Partial-order planning.
Outline Searh vs. planning Planning STRIPS operators Partial-order planning Chapter 11 Artifiial Intelligene, lp4 2005/06, Reiner Hähnle, partly based on AIMA Slides Stuart Russell and Peter Norvig, 1998
More informationNeural network-based Load Balancing and Reactive Power Control by Static VAR Compensator
nternational Journal of Computer and Eletrial Engineering, Vol. 1, No. 1, April 2009 Neural network-based Load Balaning and Reative Power Control by Stati VAR Compensator smail K. Said and Marouf Pirouti
More informationThe Union-Find Problem Kruskal s algorithm for finding an MST presented us with a problem in data-structure design. As we looked at each edge,
The Union-Find Problem Kruskal s algorithm for finding an MST presented us with a problem in data-structure design. As we looked at each edge, cheapest first, we had to determine whether its two endpoints
More informationA Three-Hybrid Treatment Method of the Compressor's Characteristic Line in Performance Prediction of Power Systems
A Three-Hybrid Treatment Method of the Compressor's Charateristi Line in Performane Predition of Power Systems A Three-Hybrid Treatment Method of the Compressor's Charateristi Line in Performane Predition
More informationLemon Signaling in Cross-Listings Michal Barzuza*
Lemon Signaling in Cross-Listings Mihal Barzuza* This paper analyzes the deision to ross-list by managers and ontrolling shareholders assuming that they have private information with respet to the amount
More informationIntelligent Measurement Processes in 3D Optical Metrology: Producing More Accurate Point Clouds
Intelligent Measurement Proesses in 3D Optial Metrology: Produing More Aurate Point Clouds Charles Mony, Ph.D. 1 President Creaform in. mony@reaform3d.om Daniel Brown, Eng. 1 Produt Manager Creaform in.
More informationImpact Simulation of Extreme Wind Generated Missiles on Radioactive Waste Storage Facilities
Impat Simulation of Extreme Wind Generated issiles on Radioative Waste Storage Failities G. Barbella Sogin S.p.A. Via Torino 6 00184 Rome (Italy), barbella@sogin.it Abstrat: The strutural design of temporary
More informationHow To Fator
CHAPTER hapter 4 > Make the Connetion 4 INTRODUCTION Developing seret odes is big business beause of the widespread use of omputers and the Internet. Corporations all over the world sell enryption systems
More informationRevista Brasileira de Ensino de Fsica, vol. 21, no. 4, Dezembro, 1999 469. Surface Charges and Electric Field in a Two-Wire
Revista Brasileira de Ensino de Fsia, vol., no. 4, Dezembro, 999 469 Surfae Charges and Eletri Field in a Two-Wire Resistive Transmission Line A. K. T.Assis and A. J. Mania Instituto de Fsia Gleb Wataghin'
More informationElectrician'sMathand BasicElectricalFormulas
Eletriian'sMathand BasiEletrialFormulas MikeHoltEnterprises,In. 1.888.NEC.CODE www.mikeholt.om Introdution Introdution This PDF is a free resoure from Mike Holt Enterprises, In. It s Unit 1 from the Eletrial
More informationTrade Information, Not Spectrum: A Novel TV White Space Information Market Model
Trade Information, Not Spetrum: A Novel TV White Spae Information Market Model Yuan Luo, Lin Gao, and Jianwei Huang 1 Abstrat In this paper, we propose a novel information market for TV white spae networks,
More informationOutline. Dynamics of trust. Dusko Pavlovic. Introduction. Private trust. Public trust. Introduction. Conclusion. Dynamics of trust.
Outline Dynamis, robustness and fragility of trust proess Kestrel Institute and Oxford University proess and future work FAST Malaga, Otober 008 Outline What is trust? : Notions of trust Alie trusts that
More informationBUILDING A SPAM FILTER USING NAÏVE BAYES. CIS 391- Intro to AI 1
BUILDING A SPAM FILTER USING NAÏVE BAYES 1 Spam or not Spam: that is the question. From: "" Subjet: real estate is the only way... gem oalvgkay Anyone an buy real estate with no
More informationHenley Business School at Univ of Reading. Pre-Experience Postgraduate Programmes Chartered Institute of Personnel and Development (CIPD)
MS in International Human Resoure Management For students entering in 2012/3 Awarding Institution: Teahing Institution: Relevant QAA subjet Benhmarking group(s): Faulty: Programme length: Date of speifiation:
More informationAgent-Based Grid Load Balancing Using Performance-Driven Task Scheduling
Agent-Based Grid Load Balaning Using Performane-Driven Task Sheduling Junwei Cao *1, Daniel P. Spooner, Stephen A. Jarvis, Subhash Saini and Graham R. Nudd * C&C Researh Laboratories, NEC Europe Ltd.,
More informationData Structure [Question Bank]
Unit I (Analysis of Algorithms) 1. What are algorithms and how they are useful? 2. Describe the factor on best algorithms depends on? 3. Differentiate: Correct & Incorrect Algorithms? 4. Write short note:
More informationJob Creation and Job Destruction over the Life Cycle: The Older Workers in the Spotlight
DISCUSSION PAPER SERIES IZA DP No. 2597 Job Creation and Job Destrution over the Life Cyle: The Older Workers in the Spotlight Jean-Olivier Hairault Arnaud Chéron François Langot February 2007 Forshungsinstitut
More informationChapter 6 A N ovel Solution Of Linear Congruenes Proeedings NCUR IX. (1995), Vol. II, pp. 708{712 Jerey F. Gold Department of Mathematis, Department of Physis University of Utah Salt Lake City, Utah 84112
More informationFig. 1.1 Rectangular foundation plan.
Footings Example 1 Design of a square spread footing of a seven-story uilding Design and detail a typial square spread footing of a six ay y five ay seven-story uilding, founded on stiff soil, supporting
More informationThe Reduced van der Waals Equation of State
The Redued van der Waals Equation of State The van der Waals equation of state is na + ( V nb) n (1) V where n is the mole number, a and b are onstants harateristi of a artiular gas, and R the gas onstant
More informationOptimal Allocation of Filters against DDoS Attacks
Optimal Alloation of Filters against DDoS Attaks Karim El Defrawy ICS Dept. University of California, Irvine Email: keldefra@ui.edu Athina Markopoulou EECS Dept. University of California, Irvine Email:
More informationSLA-based Resource Allocation for Software as a Service Provider (SaaS) in Cloud Computing Environments
2 th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing SLA-based Resoure Alloation for Software as a Servie Provider (SaaS) in Cloud Computing Environments Linlin Wu, Saurabh Kumar
More informationVOLTAGE CONTROL WITH SHUNT CAPACITANCE ON RADIAL DISTRIBUTION LINE WITH HIGH R/X FACTOR. A Thesis by. Hong-Tuan Nguyen Vu
VOLTAGE CONTROL WITH SHUNT CAPACITANCE ON RADIAL DISTRIBUTION LINE WITH HIGH R/X FACTOR A Thesis by Hong-Tuan Nguyen Vu Eletrial Engineer, Polytehni University of HCMC, 1993 Submitted to the College of
More informationComay s Paradox: Do Magnetic Charges Conserve Energy?
Comay s Paradox: Do Magneti Charges Conserve Energy? 1 Problem Kirk T. MDonald Joseph Henry Laboratories, Prineton University, Prineton, NJ 08544 (June 1, 2015; updated July 16, 2015) The interation energy
More informationFrom the Invisible Handshake to the Invisible Hand? How Import Competition Changes the Employment Relationship
From the Invisible Handshake to the Invisible Hand? How Import Competition Changes the Employment Relationship Marianne Bertrand, University of Chiago, Center for Eonomi Poliy Researh, and National Bureau
More informationGABOR AND WEBER LOCAL DESCRIPTORS PERFORMANCE IN MULTISPECTRAL EARTH OBSERVATION IMAGE DATA ANALYSIS
HENRI COANDA AIR FORCE ACADEMY ROMANIA INTERNATIONAL CONFERENCE of SCIENTIFIC PAPER AFASES 015 Brasov, 8-30 May 015 GENERAL M.R. STEFANIK ARMED FORCES ACADEMY SLOVAK REPUBLIC GABOR AND WEBER LOCAL DESCRIPTORS
More informationTo Coordinate Or Not To Coordinate? Wide-Area Traffic Management for Data Centers
To Coordinate Or Not To Coordinate? Wide-Area Traffi Management for Data Centers Srinivas Narayana, Joe Wenjie Jiang, Jennifer Rexford, Mung Chiang Department of Computer Siene, and Department of Eletrial
More informationPetri nets for the verification of Ubiquitous Systems with Transient Secure Association
Petri nets for the verifiation of Ubiquitous Systems with Transient Seure Assoiation Fernando Rosa-Velardo Tehnial Report 2/07 Dpto. de Sistemas Informátios y Computaión Universidad Complutense de Madrid
More informationContext-Sensitive Adjustments of Cognitive Control: Conflict-Adaptation Effects Are Modulated by Processing Demands of the Ongoing Task
Journal of Experimental Psyhology: Learning, Memory, and Cognition 2008, Vol. 34, No. 3, 712 718 Copyright 2008 by the Amerian Psyhologial Assoiation 0278-7393/08/$12.00 DOI: 10.1037/0278-7393.34.3.712
More informationprotection p1ann1ng report
f1re~~ protetion p1ann1ng report BUILDING CONSTRUCTION INFORMATION FROM THE CONCRETE AND MASONRY INDUSTRIES Signifiane of Fire Ratings for Building Constrution NO. 3 OF A SERIES The use of fire-resistive
More informationFOOD FOR THOUGHT Topical Insights from our Subject Matter Experts
FOOD FOR THOUGHT Topial Insights from our Sujet Matter Experts DEGREE OF DIFFERENCE TESTING: AN ALTERNATIVE TO TRADITIONAL APPROACHES The NFL White Paper Series Volume 14, June 2014 Overview Differene
More informationBig Data Analysis and Reporting with Decision Tree Induction
Big Data Analysis and Reporting with Deision Tree Indution PETRA PERNER Institute of Computer Vision and Applied Computer Sienes, IBaI Postbox 30 11 14, 04251 Leipzig GERMANY pperner@ibai-institut.de,
More informationSupply chain coordination; A Game Theory approach
aepted for publiation in the journal "Engineering Appliations of Artifiial Intelligene" 2008 upply hain oordination; A Game Theory approah Jean-Claude Hennet x and Yasemin Arda xx x LI CNR-UMR 668 Université
More informationHierarchical Clustering and Sampling Techniques for Network Monitoring
S. Sindhuja Hierarhial Clustering and Sampling Tehniques for etwork Monitoring S. Sindhuja ME ABSTRACT: etwork monitoring appliations are used to monitor network traffi flows. Clustering tehniques are
More informationRanking Community Answers by Modeling Question-Answer Relationships via Analogical Reasoning
Ranking Community Answers by Modeling Question-Answer Relationships via Analogial Reasoning Xin-Jing Wang Mirosoft Researh Asia 4F Sigma, 49 Zhihun Road Beijing, P.R.China xjwang@mirosoft.om Xudong Tu,Dan
More informationAngelCast: Cloud-based Peer-Assisted Live Streaming Using Optimized Multi-Tree Construction
AngelCast: Cloud-based Peer-Assisted Live Streaming Using Optimized Multi-Tree Constrution Raymond Sweha Boston University remos@s.bu.edu Vathe Ishakian Boston University visahak@s.bu.edu Azer Bestavros
More information10.1 The Lorentz force law
Sott Hughes 10 Marh 2005 Massahusetts Institute of Tehnology Department of Physis 8.022 Spring 2004 Leture 10: Magneti fore; Magneti fields; Ampere s law 10.1 The Lorentz fore law Until now, we have been
More informationMarker Tracking and HMD Calibration for a Video-based Augmented Reality Conferencing System
Marker Traking and HMD Calibration for a Video-based Augmented Reality Conferening System Hirokazu Kato 1 and Mark Billinghurst 2 1 Faulty of Information Sienes, Hiroshima City University 2 Human Interfae
More informationOpenScape 4000 CSTA V7 Connectivity Adapter - CSTA III, Part 2, Version 4.1. Developer s Guide A31003-G9310-I200-1-76D1
OpenSape 4000 CSTA V7 Connetivity Adapter - CSTA III, Part 2, Version 4.1 Developer s Guide A31003-G9310-I200-1-76 Our Quality and Environmental Management Systems are implemented aording to the requirements
More informationThe Goldberg Rao Algorithm for the Maximum Flow Problem
The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }
More informationSolving the Game of Awari using Parallel Retrograde Analysis
Solving the Game of Awari using Parallel Retrograde Analysis John W. Romein and Henri E. Bal Vrije Universiteit, Faulty of Sienes, Department of Mathematis and Computer Siene, Amsterdam, The Netherlands
More informationMATE: MPLS Adaptive Traffic Engineering
MATE: MPLS Adaptive Traffi Engineering Anwar Elwalid Cheng Jin Steven Low Indra Widjaja Bell Labs EECS Dept EE Dept Fujitsu Network Communiations Luent Tehnologies Univ. of Mihigan Calteh Pearl River,
More informationInformation Security 201
FAS Information Seurity 201 Desktop Referene Guide Introdution Harvard University is ommitted to proteting information resoures that are ritial to its aademi and researh mission. Harvard is equally ommitted
More informationGranular Problem Solving and Software Engineering
Granular Problem Solving and Software Engineering Haibin Zhu, Senior Member, IEEE Department of Computer Siene and Mathematis, Nipissing University, 100 College Drive, North Bay, Ontario, P1B 8L7, Canada
More informationTo the Graduate Council:
o the Graduate Counil: I am submitting herewith a dissertation written by Yan Xu entitled A Generalized Instantaneous Nonative Power heory for Parallel Nonative Power Compensation. I have examined the
More informationHEAT CONDUCTION. q A q T
HEAT CONDUCTION When a temperature gradient eist in a material, heat flows from the high temperature region to the low temperature region. The heat transfer mehanism is referred to as ondution and the
More informationPrice-based versus quantity-based approaches for stimulating the development of renewable electricity: new insights in an old debate
Prie-based versus -based approahes for stimulating the development of renewable eletriity: new insights in an old debate uthors: Dominique FINON, Philippe MENNTEU, Marie-Laure LMY, Institut d Eonomie et
More informationAnalysis of Binary Search algorithm and Selection Sort algorithm
Analysis of Binary Search algorithm and Selection Sort algorithm In this section we shall take up two representative problems in computer science, work out the algorithms based on the best strategy to
More informationSoft-Edge Flip-flops for Improved Timing Yield: Design and Optimization
Soft-Edge Flip-flops for Improved Timing Yield: Design and Optimization Abstrat Parameter variations ause high yield losses due to their large impat on iruit delay. In this paper, we propose the use of
More informationSuggested Answers, Problem Set 5 Health Economics
Suggested Answers, Problem Set 5 Health Eonomis Bill Evans Spring 2013 1. The graph is at the end of the handout. Fluoridated water strengthens teeth and redues inidene of avities. As a result, at all
More informationDraft Notes ME 608 Numerical Methods in Heat, Mass, and Momentum Transfer
Draft Notes ME 608 Numerial Methods in Heat, Mass, and Momentum Transfer Instrutor: Jayathi Y. Murthy Shool of Mehanial Engineering Purdue University Spring 2002 1998 J.Y. Murthy and S.R. Mathur. All Rights
More information' R ATIONAL. :::~i:. :'.:::::: RETENTION ':: Compliance with the way you work PRODUCT BRIEF
' R :::i:. ATIONAL :'.:::::: RETENTION ':: Compliane with the way you work, PRODUCT BRIEF In-plae Management of Unstrutured Data The explosion of unstrutured data ombined with new laws and regulations
More informationIn order to be able to design beams, we need both moments and shears. 1. Moment a) From direct design method or equivalent frame method
BEAM DESIGN In order to be able to design beams, we need both moments and shears. 1. Moment a) From diret design method or equivalent frame method b) From loads applied diretly to beams inluding beam weight
More informationFIRE DETECTION USING AUTONOMOUS AERIAL VEHICLES WITH INFRARED AND VISUAL CAMERAS. J. Ramiro Martínez-de Dios, Luis Merino and Aníbal Ollero
FE DETECTION USING AUTONOMOUS AERIAL VEHICLES WITH INFRARED AND VISUAL CAMERAS. J. Ramiro Martínez-de Dios, Luis Merino and Aníbal Ollero Robotis, Computer Vision and Intelligent Control Group. University
More informationA Robust Optimization Approach to Dynamic Pricing and Inventory Control with no Backorders
A Robust Optimization Approah to Dynami Priing and Inventory Control with no Bakorders Elodie Adida and Georgia Perakis July 24 revised July 25 Abstrat In this paper, we present a robust optimization formulation
More informationOptimal Sales Force Compensation
Optimal Sales Fore Compensation Matthias Kräkel Anja Shöttner Abstrat We analyze a dynami moral-hazard model to derive optimal sales fore ompensation plans without imposing any ad ho restritions on the
More informationScalable Hierarchical Multitask Learning Algorithms for Conversion Optimization in Display Advertising
Salable Hierarhial Multitask Learning Algorithms for Conversion Optimization in Display Advertising Amr Ahmed Google amra@google.om Abhimanyu Das Mirosoft Researh abhidas@mirosoft.om Alexander J. Smola
More informationThe Application of Mamdani Fuzzy Model for Auto Zoom Function of a Digital Camera
(IJCSIS) International Journal of Computer Siene and Information Seurity, Vol. 6, No. 3, 2009 The Appliation of Mamdani Fuzzy Model for Auto Funtion of a Digital Camera * I. Elamvazuthi, P. Vasant Universiti
More informationNASDAQ Commodity Index Methodology
NASDAQ Commodity Index Methodology January 2016 1 P a g e 1. Introdution... 5 1.1 Index Types... 5 1.2 Index History... 5 1.3 Index Curreny... 5 1.4 Index Family... 6 1.5 NQCI Index Setors... 6 2. Definitions...
More informationDeliverability on the Interstate Natural Gas Pipeline System
DOE/EIA-0618(98) Distribution Category UC-950 Deliverability on the Interstate Natural Gas Pipeline System May 1998 This report was prepared by the, the independent statistial and analytial ageny within
More informationWhy? A central concept in Computer Science. Algorithms are ubiquitous.
Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online
More information